scientific article
From MaRDI portal
Publication:3866106
zbMath0429.03039MaRDI QIDQ3866106
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
provabilityprimitive recursive arithmetictransfinite inductionformal extensionsiterated reflection principlesproof theory of arithmetical systemsproof-theoretical fine structure
Related Items (27)
Evitable iterates of the consistency operator ⋮ Reflection algebras and conservation results for theories of iterated truth ⋮ Provability algebras and proof-theoretic ordinals. I ⋮ On bimodal logics of provability ⋮ Iterated local reflection versus iterated consistency ⋮ Induction rules, reflection principles, and provably recursive functions ⋮ Transfinite induction within Peano arithmetic ⋮ Slow reflection ⋮ The logic of Turing progressions ⋮ The paradox of the knower revisited ⋮ Reducing ω-model reflection to iterated syntactic reflection ⋮ MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE ⋮ ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS ⋮ PREDICATIVITY THROUGH TRANSFINITE REFLECTION ⋮ Parameter free induction and provably total computable functions ⋮ ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR ⋮ A note on iterated consistency and infinite proofs ⋮ Proof Theoretic Analysis by Iterated Reflection ⋮ Turing-Taylor expansions for arithmetic theories ⋮ Subsystems of true arithmetic and hierarchies of functions ⋮ Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule ⋮ AXIOMATIZATION OF PROVABLE n-PROVABILITY ⋮ Conservativity spectra and Joosten-Fernández model ⋮ On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories ⋮ Some results on cut-elimination, provable well-orderings, induction and reflection ⋮ MÜNCHHAUSEN PROVABILITY ⋮ REFLECTION RANKS AND ORDINAL ANALYSIS
This page was built for publication:
