Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
From MaRDI portal
accessibility operatorcollapsing functionsconstructive theory of functions and classesdouble-negation translationimpredicative subsystems of analysisinductive generationinductively defined accessibility classinductively defined classesintuitionistic theorieslogical reflection principlemathematical reflection principlemethod of local predicativitynegative arithmetic sentencespredicative theoriesset-theoretic modelsspectrum of a theoryvirtual well-orderings
Cited in
(only showing first 100 items - show all)- The metamathematics of ergodic theory
- Patterns of resemblance of order 2
- Addendum to ``Countable algebra and set existence axioms
- An independence result for \((\Pi^ 1_ 1-CA)+BI\)
- Ordinal notations based on a hierarchy of inaccessible cardinals
- Monotone inductive definitions in a constructive theory of functions and classes
- Between constructive mathematics and PROLOG
- Fixed points in Peano arithmetic with ordinals
- Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\)
- Well-ordering proofs for Martin-Löf type theory
- Some results on cut-elimination, provable well-orderings, induction and reflection
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
- Realizability interpretation of generalized inductive definitions
- Proof theory of reflection
- The strength of some Martin-Löf type theories
- On the proof-theoretic strength of monotone induction in explicit mathematics
- Inductively generated formal topologies.
- Epsilon substitution for \(ID_1\) via cut-elimination
- Saturated models of universal theories
- Universes over Frege structures
- An intensional fixed point theory over first order arithmetic
- Understanding uniformity in Feferman's explicit mathematics
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
- Second order theories with ordinals and elementary comprehension
- Pure \(\Sigma_2\)-elementarity beyond the core
- The implicit commitment of arithmetical theories and its semantic core
- Predicativity and constructive mathematics
- Lower bounds on \(\beta (\alpha)\)
- Reverse mathematics of the uncountability of \(\mathbb{R}\)
- Splittings and robustness for the Heine-Borel theorem
- Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts
- Betwixt Turing and Kleene
- Between Turing and Kleene
- Intuitionistic fixed point logic
- A note on the theory of positive induction, \({{\text{ID}}^*_1}\)
- An ordinal analysis for theories of self-referential truth
- Proof theory and ordinal analysis
- Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives
- A flexible type system for the small Veblen ordinal
- Book review of: R. Kahle (ed.) and M. Rathjen (ed.), Gentzen's centenary. The quest for consistency
- On the unity of duality
- CZF and second order arithmetic
- Notes on some second-order systems of iterated inductive definitions and \(\Pi_1^1\)-comprehensions and relevant subsystems of set theory
- Systems of explicit mathematics with non-constructive -operator and join
- Lifting proofs from countable to uncountable mathematics
- First order theories for nonmonotone inductive definitions: Recursively inaccessible and Mahlo
- Inductive completeness of logics of programs
- Choice principles, the bar rule and autonomously iterated comprehension schemes in analysis
- Proof theory in philosophy of mathematics
- Error and predicativity
- How to compare Buchholz-style ordinal notation systems with Gordeev-style notation systems
- A theory of formal truth arithmetically equivalent to ID1
- The possibility of analysis: convergence and proofs of convergence
- The proof theory of common knowledge
- From subsystems of analysis to subsystems of set theory
- From mathesis universalis to fixed points and related set-theoretic concepts
- On Relating Theories: Proof-Theoretical Reduction
- ϱ-inaccessible ordinals, collapsing functions and a recursive notation system
- The proof-theoretic analysis of transfinitely iterated quasi least fixed points
- Generalizations of the Kruskal-Friedman theorems
- 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
- On the Completeness of Dynamic Logic
- Dual Calculus with Inductive and Coinductive Types
- From Coinductive Proofs to Exact Real Arithmetic
- Functional interpretation and inductive definitions
- The strength of admissibility without foundation
- Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
- A boundedness theorem in ID1(W)
- Natural well-orderings
- Reflecting on incompleteness
- The role of parameters in bar rule and bar induction
- About the proof-theoretic ordinals of weak fixed point theories
- The proof-theoretic analysis of transfinitely iterated fixed point theories
- Hilbert's Programs: 1917–1922
- 1998 European Summer Meeting of the Association for Symbolic Logic
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
- Intuitionistic Fixed Point Theories for Strictly Positive Operators
- ABOUT SOME FIXED POINT AXIOMS AND RELATED PRINCIPLES IN KRIPKE–PLATEK ENVIRONMENTS
- IN MEMORIAM: SOLOMON FEFERMAN (1928–2016)
- Forcing in Proof Theory
- Truths, inductive definitions, and Kripke-Platek systems over set theory
- On power set in explicit mathematics
- Pure Proof Theory Aims, Methods and Results: Extended Version of Talks Given at Oberwolfach and Haifa
- On the No-Counterexample Interpretation
- Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$
- Cut-Elimination for SBL
- On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics
- A Glimpse of $$ \sum_{3} $$-elementarity
- Countable sets versus sets that are countable in reverse mathematics
- On the uncountability of \(\mathbb{R}\)
- Simplified Cut Elimination for Kripke-Platek Set Theory
- On the Performance of Axiom Systems
- MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics
- Type theory as a foundation for computer science
- An order-theoretic characterization of the Howard-Bachmann-hierarchy
- Tiered arithmetics
- Iterated inductive definitions revisited
- The operational penumbra: some ontological aspects
- Proof theory of constructive systems: inductive types and univalence
- Predicativity and Feferman
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)