Iterated local reflection versus iterated consistency

DOI10.1016/0168-0072(95)00007-4MaRDI QIDQ1899141zbMATH OpenOpenAlexFDO

Authors Lev D. Beklemishev

Publication date 27 October 1996

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0168-0072(95)00007-4

zbMATH Keywords

provabilityPRAiterated reflectioniterated consistencynice well-orderingssmooth numerationstransfinite progression

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15)

Recommendations

• Proof theoretic analysis by iterated reflection
• Reflection algebras and conservation results for theories of iterated truth
• Autonomous progression and transfinite iteration of self-applicable truth
• Proof-theoretic analysis by iterated reflection
• Consistency proof via pointwise induction
• The logic of Turing progressions
• scientific article; zbMATH DE number 1048040
• scientific article; zbMATH DE number 1215495
• How to characterize provably total functions by local predicativity
• Variation on a theme of Schütte

Cites work

• scientific article; zbMATH DE number 440486 (Why is no real title available?)
• scientific article; zbMATH DE number 3884135 (Why is no real title available?)
• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• scientific article; zbMATH DE number 3668596 (Why is no real title available?)
• scientific article; zbMATH DE number 3786776 (Why is no real title available?)
• scientific article; zbMATH DE number 3805534 (Why is no real title available?)
• Fragments of arithmetic
• On bimodal logics of provability
• Provability logics for natural Turing progressions of arithmetical theories
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Reflection principles and iterated consistency assertions
• Solution of a problem of Leon Henkin
• Systems of Logic Based on Ordinals^†
• The formalization of interpretability
• Transfinite recursive progressions of axiomatic theories

Cited in

(21)

• Classes and truths in set theory
• Reflection calculus and conservativity spectra
• ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR
• Independent numerations of theories and of recursive progressions
• Turing progressions and their well-orders
• Proof theoretic analysis by iterated reflection
• Slow reflection
• Principles for object-linguistic consequence: from logical to irreflexive
• ON THE ITERATED ω‐RULE
• The logic of Turing progressions
• Evitable iterates of the consistency operator
• Transfinite Progressions: A Second Look at Completeness
• A note on iterated consistency and infinite proofs
• Autonomous progression and transfinite iteration of self-applicable truth
• Consistency and localizability
• The omega-rule interpretation of transfinite provability logic
• Reflection ranks and ordinal analysis
• On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
• Parameter free induction and provably total computable functions
• Turing-Taylor expansions for arithmetic theories
• A note on the consistency operator

This page was built for publication: Iterated local reflection versus iterated consistency

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