Provability logics for natural Turing progressions of arithmetical theories

DOI10.1007/BF00370390zbMath0728.03017OpenAlexW1984643361MaRDI QIDQ804564

Lev D. Beklemishev

Publication date: 1991

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00370390

zbMATH Keywords

provability logicarithmetical completenessarithmetical interpretationmodal operators for progressions of theoriesrecursively enumerable theories

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Applications of computability and recursion theory (03D80) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Related Items

Evitable iterates of the consistency operator, On bimodal logics of provability, Iterated local reflection versus iterated consistency, The logic of Turing progressions, The omega-rule interpretation of transfinite provability logic, ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR, Independent numerations of theories and recursive progressions

Cites Work

• Modal logics with several operators and probability interpretations
• Resolution of singularities in bordism
• Quantified modal logic and self-reference
• Provability interpretations of modal logic
• Wie die Beweistheorie zu ihren Ordinalzahlen kam und kommt
• Provability in finite subtheories of PA and relative interpretability: a modal investigation
• Transfinite recursive progressions of axiomatic theories