REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/3601
Pełny rekord metadanych
Pole DCWartośćJęzyk
dc.contributor.authorBancerek, Grzegorz-
dc.date.accessioned2015-12-06T19:04:36Z-
dc.date.available2015-12-06T19:04:36Z-
dc.date.issued2011-
dc.identifier.citationFormalized Mathematics, Volume 19, Issue 2, 2011, Pages 83-92-
dc.identifier.issn1426-2630-
dc.identifier.issn1898-9934-
dc.identifier.urihttp://hdl.handle.net/11320/3601-
dc.description.abstractThe Veblen hierarchy is an extension of the construction of epsilon numbers (fixpoints of the exponential map: ωε = ε). It is a collection φα of the Veblen Functions where φ0(β) = ωβ and φ1(β) = εβ. The sequence of fixpoints of φ1 function form φ2, etc. For a limit non empty ordinal λ the function φλ is the sequence of common fixpoints of all functions φα where α < λ. The Mizar formalization of the concept cannot be done directly as the Veblen functions are classes (not (small) sets). It is done with use of universal sets (Tarski classes). Namely, we define the Veblen functions in a given universal set and φα(β) as a value of Veblen function from the smallest universal set including α and β.-
dc.language.isoen-
dc.publisherDe Gruyter Open-
dc.titleVeblen Hierarchy-
dc.typeArticle-
dc.identifier.doi10.2478/v10037-011-0014-5-
dc.description.AffiliationBiałystok Technical University, Poland-
dc.description.referencesGrzegorz Bancerek. Increasing and continuous ordinal sequences. Formalized Mathematics, 1(4):711-714, 1990.-
dc.description.referencesGrzegorz Bancerek. Köonig's theorem. Formalized Mathematics, 1(3):589-593, 1990.-
dc.description.referencesGrzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.-
dc.description.referencesGrzegorz Bancerek. Sequences of ordinal numbers. Formalized Mathematics, 1(2):281-290, 1990.-
dc.description.referencesGrzegorz Bancerek. Tarski's classes and ranks. Formalized Mathematics, 1(3):563-567, 1990.-
dc.description.referencesGrzegorz Bancerek. The well ordering relations. Formalized Mathematics, 1(1):123-129, 1990.-
dc.description.referencesGrzegorz Bancerek. Zermelo theorem and axiom of choice. Formalized Mathematics, 1(2):265-267, 1990.-
dc.description.referencesGrzegorz Bancerek. Epsilon numbers and Cantor normal form. Formalized Mathematics, 17(4):249-256, 2009, doi: 10.2478/v10037-009-0032-8.-
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. 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.referencesAgata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.-
dc.description.referencesBogdan Nowak and Grzegorz Bancerek. Universal classes. Formalized Mathematics, 1(3):595-600, 1990.-
dc.description.referencesKarol Pąk. The Nagata-Smirnov theorem. Part I. Formalized Mathematics, 12(3):341-346, 2004.-
dc.description.referencesPiotr Rudnicki and Andrzej Trybulec. Abian's fixed point theorem. Formalized Mathematics, 6(3):335-338, 1997.-
dc.description.referencesZinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.-
dc.description.referencesTetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences. Formalized Mathematics, 9(4):825-829, 2001.-
dc.description.referencesEdmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.-
Występuje w kolekcji(ach):Formalized Mathematics, 2011, Volume 19, Issue 2

Pliki w tej pozycji:
Plik Opis RozmiarFormat 
v10037-011-0014-5.pdf288 kBAdobe PDFOtwórz
Pokaż uproszczony widok rekordu Zobacz statystyki


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