Proof-theoretic analysis by iterated reflection
From MaRDI portal
Publication:1407608
DOI10.1007/s00153-002-0158-7zbMath1026.03041OpenAlexW1989844562MaRDI QIDQ1407608
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
conservationfragments of arithmeticlogical complexityrestricted inductionproof-theoretic ordinalsiterated reflectionordinal analysis of formal systems
Related Items
Reflection algebras and conservation results for theories of iterated truth, Provability algebras and proof-theoretic ordinals. I, On elementary theories of ordinal notation systems based on reflection principles, Relative Truth Definability of Axiomatic Truth Theories, The Henkin Sentence, Slow reflection, Short proofs for slow consistency, The logic of Turing progressions, Reducing ω-model reflection to iterated syntactic reflection, ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS, Local reflection, definable elements and 1-provability, Classes and truths in set theory, Reflection calculus and conservativity spectra, Parameter free induction and provably total computable functions, ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR, A NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTION, Axiomatizing provable \(n\)-provability, A note on iterated consistency and infinite proofs, Proof Theoretic Analysis by Iterated Reflection, 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10, Turing-Taylor expansions for arithmetic theories, On a strengthening of the non-isomorphism theorem for provability algebras, Proof lengths for instances of the Paris-Harrington principle, Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA, The predicative Frege hierarchy, The strength of extensionality. I: Weak weak set theories with infinity, AXIOMATIZATION OF PROVABLE n-PROVABILITY, Ordinal analyses for monotone and cofinal transfinite inductions, Interpretability in PRA, Conservativity spectra and Joosten-Fernández model, On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories, On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness, MÜNCHHAUSEN PROVABILITY, REFLECTION RANKS AND ORDINAL ANALYSIS
