Iterated local reflection versus iterated consistency

DOI10.1016/0168-0072(95)00007-4zbMath0848.03031MaRDI QIDQ1899141

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

provability; PRA; iterated reflection; iterated consistency; nice well-orderings; smooth numerations; transfinite progression

Mathematics Subject Classification ID

03F35: Second- and higher-order arithmetic and fragments

03F15: Recursive ordinals and ordinal notations

Related Items

ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR, Transfinite Progressions: A Second Look at Completeness, A note on the consistency operator, REFLECTION RANKS AND ORDINAL ANALYSIS, Reflection calculus and conservativity spectra, Evitable iterates of the consistency operator, Classes and truths in set theory, Turing-Taylor expansions for arithmetic theories, Principles for object-linguistic consequence: from logical to irreflexive, The omega-rule interpretation of transfinite provability logic, Parameter free induction and provably total computable functions, The logic of Turing progressions, Slow reflection, On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories

Cites Work

• Fragments of arithmetic
• Provability logics for natural Turing progressions of arithmetical theories
• The formalization of interpretability
• On bimodal logics of provability
• Solution of a problem of Leon Henkin
• Reflection principles and iterated consistency assertions
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Transfinite recursive progressions of axiomatic theories
• Systems of Logic Based on Ordinals^†
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item