Proof-theoretic analysis by iterated reflection

DOI10.1007/S00153-002-0158-7MaRDI QIDQ1407608zbMATH OpenOpenAlexFDO

Authors Lev D. Beklemishev

Publication date 16 September 2003

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00153-002-0158-7

zbMATH Keywords

conservationfragments of arithmeticlogical complexityrestricted inductionproof-theoretic ordinalsiterated reflectionordinal analysis of formal systems

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Recursive ordinals and ordinal notations (03F15)

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

(45)

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

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)