REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/3620
Pełny rekord metadanych
Pole DCWartośćJęzyk
dc.contributor.authorBancerek, Grzegorz-
dc.date.accessioned2015-12-06T19:05:04Z-
dc.date.available2015-12-06T19:05:04Z-
dc.date.issued2011-
dc.identifier.citationFormalized Mathematics, Volume 19, Issue 4, 2011, Pages 241-250-
dc.identifier.issn1426-2630-
dc.identifier.issn1898-9934-
dc.identifier.urihttp://hdl.handle.net/11320/3620-
dc.description.abstractIn the paper the concept of stacks is formalized. As the main result the Theorem of Representation for Stacks is given. Formalization is done according to [13].-
dc.language.isoen-
dc.publisherDe Gruyter Open-
dc.titleRepresentation Theorem for Stacks-
dc.typeArticle-
dc.identifier.doi10.2478/v10037-011-0033-2-
dc.description.AffiliationBiałystok Technical University, Poland-
dc.description.referencesGrzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.-
dc.description.referencesGrzegorz Bancerek. Filters - part II. Quotient lattices modulo filters and direct product of two lattices. Formalized Mathematics, 2(3):433-438, 1991.-
dc.description.referencesGrzegorz Bancerek. Reduction relations. Formalized Mathematics, 5(4):469-478, 1996.-
dc.description.referencesGrzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.-
dc.description.referencesGrzegorz Bancerek and Andrzej Trybulec. Miscellaneous facts about functions. Formalized Mathematics, 5(4):485-492, 1996.-
dc.description.referencesCzesław Byliński. Binary operations. Formalized Mathematics, 1(1):175-180, 1990.-
dc.description.referencesCzesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990.-
dc.description.referencesCzesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.-
dc.description.referencesCzesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.-
dc.description.referencesCzesław Byliński. The modification of a function by a function and the iteration of the composition of a function. Formalized Mathematics, 1(3):521-527, 1990.-
dc.description.referencesCzesław Byliński. Partial functions. Formalized Mathematics, 1(2):357-367, 1990.-
dc.description.referencesCzesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.-
dc.description.referencesGrażyna Mirkowska and Andrzej Salwicki. Algorithmic Logic. PWN-Polish Scientific Publisher, 1987.-
dc.description.referencesKonrad Raczkowski and Paweł Sadowski. Equivalence relations and classes of abstraction. Formalized Mathematics, 1(3):441-444, 1990.-
dc.description.referencesAndrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115-122, 1990.-
dc.description.referencesWojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569-573, 1990.-
dc.description.referencesWojciech A. Trybulec. Partially ordered sets. Formalized Mathematics, 1(2):313-319, 1990.-
dc.description.referencesZinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.-
dc.description.referencesEdmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.-
dc.description.referencesEdmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990.-
dc.description.referencesEdmund Woronowicz and Anna Zalewska. Properties of binary relations. Formalized Mathematics, 1(1):85-89, 1990.-
Występuje w kolekcji(ach):Formalized Mathematics, 2011, Volume 19, Issue 4

Pliki w tej pozycji:
Plik Opis RozmiarFormat 
v10037-011-0033-2.pdf246,33 kBAdobe PDFOtwórz
Pokaż uproszczony widok rekordu Zobacz statystyki


Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL Creative Commons