Proof-theoretic analysis by iterated reflection
From MaRDI portal
Recommendations
- Proof theoretic analysis by iterated reflection
- Proof theory of reflection
- scientific article; zbMATH DE number 1552515
- scientific article; zbMATH DE number 1341617
- scientific article; zbMATH DE number 432706
- Proof analysis in intermediate logics
- Proof-theoretic analysis of termination proofs
- scientific article; zbMATH DE number 956475
- scientific article; zbMATH DE number 2185723
- Analytic methods for the logic of proofs
Cited in
(51)- The strength of extensionality. I: Weak weak set theories with infinity
- Interpretability in PRA
- On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness
- Axiomatizing provable \(n\)-provability
- A note on iterated consistency and infinite proofs
- Provability algebras and proof-theoretic ordinals. I
- Iterated local reflection versus iterated consistency
- Parameter free induction and provably total computable functions
- Conservativity spectra and Joosten-Fernández model
- Reflection algebras and conservation results for theories of iterated truth
- Short proofs for slow consistency
- The logic of Turing progressions
- Local reflection, definable elements and 1-provability
- On a strengthening of the non-isomorphism theorem for provability algebras
- The predicative Frege hierarchy
- Ordinal analyses for monotone and cofinal transfinite inductions
- Slow reflection
- On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
- On elementary theories of ordinal notation systems based on reflection principles
- 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
- scientific article; zbMATH DE number 2185723 (Why is no real title available?)
- An Investigation of Hilbert’s Implicit Reasoning through Proof Discovery in Idle-Time
- Relative Truth Definability of Axiomatic Truth Theories
- Reflection principles and provability algebras in formal arithmetic
- The proof-theoretic analysis of transfinitely iterated quasi least fixed points
- The Henkin sentence
- ON THE ITERATED ω‐RULE
- scientific article; zbMATH DE number 1048040 (Why is no real title available?)
- scientific article; zbMATH DE number 1951638 (Why is no real title available?)
- Classes and truths in set theory
- Iterated reflection over full disquotational truth
- ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR
- A note on predicative ordinal analysis. I. Iterated comprehension and transfinite induction
- Proof theoretic analysis by iterated reflection
- MÜNCHHAUSEN PROVABILITY
- Reflection ranks and ordinal analysis
- Turing-Taylor expansions for arithmetic theories
- Iterated inductive definitions revisited
- AXIOMATIZATION OF PROVABLE n-PROVABILITY
- Proof lengths for instances of the Paris-Harrington principle
- Reflection calculus and conservativity spectra
- A proof theoretic analysis of intruder theories
- A Proof Theoretic Analysis of Intruder Theories
- Reducing ω-model reflection to iterated syntactic reflection
- ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS
- On the hierarchy of natural theories
- Fragments of arithmetic and cyclic proofs
- Feferman's completeness theorem
- Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA
- Automatic structures and the problem of natural well-orderings
- Iterating reflection over intuitionistic arithmetic
This page was built for publication: Proof-theoretic analysis by iterated reflection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407608)
