A simplification of the Bachmann method for generating large countable ordinals
From MaRDI portal
Publication:4067070
DOI10.2307/2271898zbMath0309.02027OpenAlexW2087185740MaRDI QIDQ4067070
Publication date: 1975
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2271898
Descriptive set theory (03E15) Large cardinals (03E55) Recursive ordinals and ordinal notations (03F15) Ordinal and cardinal numbers (03E10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55)
Related Items (17)
A constructive consistency proof of a fragment of set theory ⋮ On the Performance of Axiom Systems ⋮ Ordinal notations based on a hierarchy of inaccessible cardinals ⋮ Ordinal arithmetic based on Skolem hulling ⋮ Rekursion über Dilatoren und die Bachmann-Hierarchie. (Recursion over dilators and the Bachmann hierarchy) ⋮ Natural well-orderings ⋮ Proof-theoretical analysis: Weak systems of functions and classes ⋮ Well-Partial Orderings and their Maximal Order Types ⋮ Ordinal arithmetic with simultaneously defined theta-functions ⋮ A Survey on Ordinal Notations Around the Bachmann-Howard Ordinal ⋮ Pure \(\Sigma_2\)-elementarity beyond the core ⋮ A Survey on Ordinal Notations Around the Bachmann–Howard Ordinal ⋮ A flexible type system for the small Veblen ordinal ⋮ Provable wellorderings of formal theories for transfinitely iterated inductive definitions ⋮ … and so on: Schütte on Naming Ordinals ⋮ A Glimpse of $$ \sum_{3} $$-elementarity ⋮ Cut-elimination for impredicative infinitary systems part I. Ordinal-analysis for ID1
This page was built for publication: A simplification of the Bachmann method for generating large countable ordinals
