ϱ-inaccessible ordinals, collapsing functions and a recursive notation system
From MaRDI portal
Publication:3335775
DOI10.1007/BF02007140zbMath0545.03031OpenAlexW2066878363MaRDI QIDQ3335775
Publication date: 1984
Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/138022
ordinal functionscollapsing functionsinaccessible ordinalsconstructive notation systemsconstructive well- orderingsstrong primitive recursive ordinal notation system
Related Items
Ein Wohlordnungsbeweis für das Ordinalzahlensystem T(J). (A proof of the wellordering of the ordinal number system T(J)), Eine Erweiterung T(V') des Ordinalzahlensystems \(C_{\Omega}(\Lambda _ 0)\) von G. Jäger. (An extension T(V') of the ordinal system \(C_{\Omega}(\Lambda _ 0)\) by G. Jäger), Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees, A new system of proof-theoretic ordinal functions, Ordinal notations based on a hierarchy of inaccessible cardinals, Natural well-orderings, Ordinal notations based on a weakly Mahlo cardinal, Proof theory and ordinal analysis, Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees, A Survey on Ordinal Notations Around the Bachmann–Howard Ordinal, Majorisier Ungsrelationen und Fundamentalfolgen eines Ordinalzahlensystems von G. Jäger, Proof-theoretic analysis of KPM, Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM
Cites Work
