A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\)
DOI10.1016/j.apal.2007.03.004zbMath1121.03080OpenAlexW2101420068MaRDI QIDQ2370371
Publication date: 25 June 2007
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2007.03.004
surveyphase transitionordinal notationsPeano arithmeticstructural equivalenceFriedman-style miniaturizationslowly well-orderednessstructural nonequivalence
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) First-order arithmetic and fragments (03F30) Recursive ordinals and ordinal notations (03F15)
Related Items (1)
Cites Work
- A new system of proof-theoretic ordinal functions
- Proof-theoretic investigations on Kruskal's theorem
- Wie die Beweistheorie zu ihren Ordinalzahlen kam und kommt
- Provability algebras and proof-theoretic ordinals. I
- Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
- The number of trees
- Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
- Accessible Independence Results for Peano Arithmetic
- A Uniform Approach to Fundamental Sequences and Hierarchies
- An application of graphical enumeration to PA *
- Systems of predicative analysis
- Worms, gaps, and hydras
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Systems of predicative analysis, II: Representations of ordinals
- Ordering by Divisibility in Abstract Algebras
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\)
