Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies

Cited in

(only showing first 100 items - show all)

On the Performance of Axiom Systems
A NOTE ON THEORIES FOR QUASI-INDUCTIVE DEFINITIONS
Fixed points in Peano arithmetic with ordinals
Ordinal arithmetic based on Skolem hulling
A boundedness theorem in ID₁(W)
An independence result for $(\Pi^ 1_ 1-CA)+BI$
Book review of: R. Kahle (ed.) and M. Rathjen (ed.), Gentzen's centenary. The quest for consistency
Patterns of resemblance of order 2
The prehistory of the subsystems of second-order arithmetic
Truths, inductive definitions, and Kripke-Platek systems over set theory
Foundations for analysis and proof theory
Reflecting on incompleteness
Well-ordering proofs for Martin-Löf type theory
The proof-theoretic analysis of transfinitely iterated fixed point theories
Predicativity and constructive mathematics
An order-theoretic characterization of the Howard-Bachmann-hierarchy
Intuitionistic fixed point logic
The Urysohn extension theorem for Bishop spaces
Generalizing classical and effective model theory in theories of operations and classes
On the unity of duality
Countable sets versus sets that are countable in reverse mathematics
Some results on cut-elimination, provable well-orderings, induction and reflection
A new model construction by making a detour via intuitionistic theories. IV: A closer connection between $\mathrm{KP} \omega$ and $\mathrm{BI}$.
Induction and inductive definitions in fragments of second order arithmetic
Understanding uniformity in Feferman's explicit mathematics
ϱ-inaccessible ordinals, collapsing functions and a recursive notation system
From subsystems of analysis to subsystems of set theory
The possibility of analysis: convergence and proofs of convergence
Ordinal notations based on a hierarchy of inaccessible cardinals
Functional interpretation and inductive definitions
Second order theories with ordinals and elementary comprehension
Pure Proof Theory Aims, Methods and Results: Extended Version of Talks Given at Oberwolfach and Haifa
Inductive completeness of logics of programs
A flexible type system for the small Veblen ordinal
An intensional fixed point theory over first order arithmetic
Type-theoretic interpretation of iterated, strictly positive inductive definitions
IN MEMORIAM: SOLOMON FEFERMAN (1928–2016)
2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
Reverse mathematics of the uncountability of $\mathbb{R}$
Universes over Frege structures
Betwixt Turing and Kleene
On power set in explicit mathematics
Fragments of arithmetic
A Glimpse of $$ \sum_{3} $$-elementarity
Proofs, programs, processes
On the uncountability of $\mathbb{R}$
Ordinal notations based on a weakly Mahlo cardinal
Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts
Lower bounds on $\beta (\alpha)$
Epsilon substitution for $ID_1$ via cut-elimination
1998 European Summer Meeting of the Association for Symbolic Logic
Simplified Cut Elimination for Kripke-Platek Set Theory
Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives
First order theories for nonmonotone inductive definitions: Recursively inaccessible and Mahlo
Splittings and robustness for the Heine-Borel theorem
The strength of some Martin-Löf type theories
Addendum to ``Countable algebra and set existence axioms
The non-normal abyss in Kleene's computability theory
The constructive Hilbert program and the limits of Martin-Löf type theory
Iterated inductive definitions revisited
Proof theory of reflection
The role of parameters in bar rule and bar induction
Monotone inductive definitions in a constructive theory of functions and classes
Proof theory and ordinal analysis
Cut-Elimination for SBL
Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
Choice principles, the bar rule and autonomously iterated comprehension schemes in analysis
Proof theory of constructive systems: inductive types and univalence
MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics
The metamathematics of ergodic theory
Proof theory in philosophy of mathematics
Tiered arithmetics
The operational penumbra: some ontological aspects
Feferman's skepticism about set theory
Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees
Exploring the abyss in Kleene's computability theory
On the No-Counterexample Interpretation
Type theory as a foundation for computer science
How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
From mathesis universalis to fixed points and related set-theoretic concepts
On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor
How to compare Buchholz-style ordinal notation systems with Gordeev-style notation systems
Systems of explicit mathematics with non-constructive $\mu$-operator. I
On the computational properties of the uncountability of the real numbers
On the proof-theoretic strength of monotone induction in explicit mathematics
A note on the theory of positive induction, ${{\text{ID}}^*_1}$
Predicative functionals and an interpretation of ${\widehat{\text{ID}}_{<\omega}}$
About the proof-theoretic ordinals of weak fixed point theories
Axiomatizing semantic theories of truth?
The proof theory of common knowledge
Revisiting the conservativity of fixpoints over intuitionistic arithmetic
Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$
On the Completeness of Dynamic Logic
Forcing in Proof Theory
Predicativity and Feferman
The strength of admissibility without foundation
Generalizations of the Kruskal-Friedman theorems
Intuitionistic Fixed Point Theories for Strictly Positive Operators
Between Turing and Kleene
Hilbert's Programs: 1917–1922

This page was built for publication: Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1166517)