Iterated local reflection versus iterated consistency
From MaRDI portal
Publication:1899141
DOI10.1016/0168-0072(95)00007-4zbMath0848.03031OpenAlexW1974965205MaRDI QIDQ1899141
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
provabilityPRAiterated reflectioniterated consistencynice well-orderingssmooth numerationstransfinite progression
Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15)
Related Items (14)
Evitable iterates of the consistency operator ⋮ Slow reflection ⋮ The logic of Turing progressions ⋮ The omega-rule interpretation of transfinite provability logic ⋮ 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 ⋮ Turing-Taylor expansions for arithmetic theories ⋮ Transfinite Progressions: A Second Look at Completeness ⋮ Principles for object-linguistic consequence: from logical to irreflexive ⋮ A note on the consistency operator ⋮ On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories ⋮ REFLECTION RANKS AND ORDINAL ANALYSIS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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†
This page was built for publication: Iterated local reflection versus iterated consistency
