Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition

DOI10.1007/s00153-017-0559-2zbMath1417.03292arXiv1505.01359OpenAlexW2115072159WikidataQ59887777 ScholiaQ59887777MaRDI QIDQ2402963

Michael Rathjen, Jeroen Van der Meeren, Andreas Weiermann

Publication date: 15 September 2017

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.01359

zbMATH Keywords

collapsing functionmaximal order typeordinal notation systemswell-partial-orderingsgap-embeddability relation

Mathematics Subject Classification ID

Partial orders, general (06A06) Recursive ordinals and ordinal notations (03F15) Ordinal and cardinal numbers (03E10)

Related Items

Minimal bad sequences are necessary for a uniform Kruskal theorem, Bachmann-Howard derivatives, From Kruskal’s theorem to Friedman’s gap condition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An order-theoretic characterization of the Howard-Bachmann-hierarchy
• Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees
• Proof theory. 2nd ed
• An independence result for \((\Pi^ 1_ 1-CA)+BI\)
• A new system of proof-theoretic ordinal functions
• Proof-theoretic investigations on Kruskal's theorem
• Well-partial-orderings and the big Veblen number
• On Fraissé's order type conjecture
• The theory of well-quasi-ordering: a frequently discovered concept
• Ordinal arithmetic with simultaneously defined theta-functions
• Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
• Binary Trees and (Maximal) Order Types
• Ordering by Divisibility in Abstract Algebras