scientific article

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

proof theory provability admissible sets ordinal structures

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursive ordinals and ordinal notations (03F15)

Related Items

Inaccessible set axioms may have little consistency strength, Proof theory of reflection, Explicit mathematics with the monotone fixed point principle. II: Models, The role of parameters in bar rule and bar induction, Understanding uniformity in Feferman's explicit mathematics, On the proof-theoretic strength of monotone induction in explicit mathematics, Epsilon substitution for $ID_1$ via cut-elimination, Operational closure and stability, RELATIVIZING OPERATIONAL SET THEORY, Analysis of a Double Kruskal Theorem, Well ordering principles for iterated $\Pi^1_1$-comprehension, The proof-theoretic analysis of $\Sigma_{1}^{1}$ transfinite dependent choice, Admissible closures of polynomial time computable arithmetic, Computable aspects of the Bachmann–Howard principle, The Recursively Mahlo Property in Second Order Arithmetic, A logic of abstraction related to finite constructive number classes, The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories, A few more dissimilarities between second-order arithmetic and set theory, Wellfoundedness proof with the maximal distinguished set, On the relationship between ATR₀ and, Interpreting classical theories in constructive ones, A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is $\Pi_1$-equivalent to KP, On power set in explicit mathematics, Pure Proof Theory Aims, Methods and Results: Extended Version of Talks Given at Oberwolfach and Haifa, On Feferman's operational set theory \textsf{OST}, Ordinal Analysis of Intuitionistic Power and Exponentiation Kripke Platek Set Theory, The Operational Perspective: Three Routes, From Subsystems of Analysis to Subsystems of Set Theory, Ordinal analysis of non-monotone $\Pi_1^0$-definable inductive definitions, First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo, Fixed points in Peano arithmetic with ordinals, Elementary patterns of resemblance, On the relationship between fixed points and iteration in admissible set theory without foundation, Universes in explicit mathematics, $\Pi_1^1$-comprehension as a well-ordering principle, Proof theory and ordinal analysis, Extending the system T$_0$ of explicit mathematics: The limit and Mahlo axioms, Notes on some second-order systems of iterated inductive definitions and $\Pi_1^1$-comprehensions and relevant subsystems of set theory, Iterated Inductive Definitions Revisited, Proof Theory of Constructive Systems: Inductive Types and Univalence, Patterns of resemblance of order 2, Full operational set theory with unbounded existential quantification and power set, Patterns of resemblance and Bachmann-Howard fixed points, Functional interpretation and inductive definitions, The non-constructive $\mu$ operator, fixed point theories with ordinals, and the bar rule, Reflections on reflections in explicit mathematics, Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$, An Upper Bound for the Proof-Theoretic Strength of Martin-Löf Type Theory with W-type and One Universe, A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics $T_0$, Proof-theoretic analysis of KPM