Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/well-partial-orderings-and-the-big-veblen-number-ZdSnsJviWN
References (17)
-
A. Weiermann (2009)
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets -
Matthias Aschenbrenner, W. Pong (2003)
Orderings of monomial idealsFundamenta Mathematicae, 181
-
A. Weiermann (1994)
Complexity Bounds for Some Finite Forms of Kruskal's TheoremJ. Symb. Comput., 18
-
A. Weiermann (1993)
An Order-Theoretic Characterization of the Schütte-Veblen-HierarchyMath. Log. Q., 39
-
L. Gordeev (1990)
Generalizations of the Kruskal-Friedman theoremsJournal of Symbolic Logic, 55
-
Dick Jongh, R. Parikh (1977)
Well-partial orderings and hierarchies, 80
-
D. Schmidt (1979)
Well-Partial Orderings and Their Maximal Order Types -
H. Friedman, L. Harrington (1985)
Harvey Friedman's Research on the Foundations of Mathematics -
A. Weiermann (1991)
Proving Termination for Term Rewriting Systems -
J. Kruskal (1972)
The Theory of Well-Quasi-Ordering: A Frequently Discovered ConceptJ. Comb. Theory, Ser. A, 13
-
O. Veblen (1908)
Continuous increasing functions of finite and transfinite ordinalsTransactions of the American Mathematical Society, 9
-
S. Simpson (1985)
Nonprovability of Certain Combinatorial Properties of Finite TreesStudies in logic and the foundations of mathematics, 117
-
K. Schütte (1954)
Kennzeichnung von Ordnungszahlen durch rekursiv erklärte FunktionenMathematische Annalen, 127
-
D. Schmidt (1975)
Bounds for the closure ordinals of replete monotonic increasing functionsJournal of Symbolic Logic, 40
-
I. Kríz (1989)
Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjectureAnnals of Mathematics, 130
-
W. Buchholz, K. Schütte (1988)
Proof Theory of Impredicative Subsystems of Analysis -
M. Rathjen, A. Weiermann (1993)
Proof-Theoretic Investigations on Kruskal's TheoremAnn. Pure Appl. Log., 60
- Publisher
- Springer Journals
- Copyright
- Copyright © 2014 by Springer-Verlag Berlin Heidelberg
- Subject
- Mathematics; Mathematical Logic and Foundations; Mathematics, general; Algebra
- ISSN
- 0933-5846
- eISSN
- 1432-0665
- DOI
- 10.1007/s00153-014-0408-5
- Publisher site
- See Article on Publisher Site
Abstract
In this article we characterize a countable ordinal known as the big Veblen number in terms of natural well-partially ordered tree-like structures. To this end, we consider generalized trees where the immediate subtrees are grouped in pairs with address-like objects. Motivated by natural ordering properties, extracted from the standard notations for the big Veblen number, we investigate different choices for embeddability relations on the generalized trees. We observe that for addresses using one finite sequence only, the embeddability coincides with the classical tree-embeddability, but in this article we are interested in more general situations (transfinite addresses and well-partially ordered addresses). We prove that the maximal order type of some of these new embeddability relations hit precisely the big Veblen ordinal $${\vartheta \Omega^{\Omega}}$$ ϑ Ω Ω . Somewhat surprisingly, changing a little bit the well-partially ordered addresses (going from multisets to finite sequences), the maximal order type hits an ordinal which exceeds the big Veblen number by far, namely $${\vartheta \Omega^{\Omega^\Omega}}$$ ϑ Ω Ω Ω . Our results contribute to the research program (originally initiated by Diana Schmidt) on classifying properties of natural well-orderings in terms of order-theoretic properties of the functions generating the orderings.
Journal
Archive for Mathematical Logic – Springer Journals
Published: Nov 13, 2014