Provability logics for natural Turing progressions of arithmetical theories

DOI10.1007/BF00370390zbMATH Open0728.03017OpenAlexW1984643361MaRDI QIDQ804564FDOQ804564

Authors: 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

Recommendations

• The logic of Turing progressions
• Models of transfinite provability logic
• scientific article; zbMATH DE number 4195937
• Provability logics relative to a fixed extension of Peano arithmetic
• On bimodal logics of provability

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)

Cites Work

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

Cited In (15)

• A proof theory for the logic of provability in true arithmetic
• Title not available (Why is that?)
• ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR
• Relational semantics for the Turing Schmerl calculus
• Turing progressions and their well-orders
• Title not available (Why is that?)
• The logic of Turing progressions
• Evitable iterates of the consistency operator
• On bimodal logics of provability
• Iterated local reflection versus iterated consistency
• The omega-rule interpretation of transfinite provability logic
• Independent numerations of theories and recursive progressions
• The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic
• Turing-Taylor expansions for arithmetic theories
• PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC

This page was built for publication: Provability logics for natural Turing progressions of arithmetical theories

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