How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems
From MaRDI portal
Publication:3195714
DOI10.1007/978-3-319-20028-6_36zbMath1461.03053OpenAlexW2282067179MaRDI QIDQ3195714
Andreas Weiermann, Jeroen Van der Meeren
Publication date: 20 October 2015
Published in: Evolving Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-20028-6_36
embeddingsorder typeordinal notation systemswell-partial-orderingsBuchholz's notation systemGordeev's notation system
Related Items
Cites Work
- Unnamed Item
- Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees
- Harvey Friedman's research on the foundations of mathematics
- A new system of proof-theoretic ordinal functions
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension
- Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
- Well-partial-orderings and the big Veblen number
- Generalizations of the Kruskal-Friedman theorems
- A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
- Natural well-orderings
- Generalizations of the one-dimensional version of the Kruskal-Friedman theorems
