scientific article; zbMATH DE number 3532926
From MaRDI portal
Publication:4109654
zbMath0342.02021MaRDI QIDQ4109654
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursive ordinals and ordinal notations (03F15) Ordinal and cardinal numbers (03E10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (24)
A constructive consistency proof of a fragment of set theory ⋮ Ordinal notations based on a hierarchy of inaccessible cardinals ⋮ How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems ⋮ Ordinal arithmetic based on Skolem hulling ⋮ Well ordering principles for iterated \(\Pi^1_1\)-comprehension ⋮ Wellfoundedness proofs by means of non-monotonic inductive definitions. II: First order operators ⋮ Proof-theoretical analysis: Weak systems of functions and classes ⋮ Wellfoundedness proof with the maximal distinguished set ⋮ Well-Partial Orderings and their Maximal Order Types ⋮ A Survey on Ordinal Notations Around the Bachmann-Howard Ordinal ⋮ Einführung der NormalfunktionenΘ a ohne Auswahlaxiom und ohne Regularitätsbedingungohne Auswahlaxiom und ohne Regularitätsbedingung ⋮ Die Beziehungen Zwischen den OrdinalzahlsystemenΣ Und $$\bar \Theta \left( \omega \right)$$ ⋮ ϱ-inaccessible ordinals, collapsing functions and a recursive notation system ⋮ Über Teilsysteme von $$\bar \Theta $$ ({g}) ⋮ Proof theory and ordinal analysis ⋮ Pure \(\Sigma_2\)-elementarity beyond the core ⋮ A Survey on Ordinal Notations Around the Bachmann–Howard Ordinal ⋮ Reflections on reflections in explicit mathematics ⋮ Replacement versus collection and related topics in constructive Zermelo-Fraenkel set theory ⋮ Well-ordering proofs for Martin-Löf type theory ⋮ Cut-Elimination for SBL ⋮ A Glimpse of $$ \sum_{3} $$-elementarity ⋮ Ein Wohlordnungsbeweis mit $$ \Delta^{1}_{2} $$-Komprehension und Bar-Induktion ⋮ Cut-elimination for impredicative infinitary systems part I. Ordinal-analysis for ID1
This page was built for publication: