The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic

DOI10.1007/BF00297579zbMath0581.03009MaRDI QIDQ1068069

Albert Visser

Publication date: 1984

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

zbMATH Keywords

Löb's logicSolovay's logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Related Items

On bimodal logics of provability ⋮ Generic generalized Rosser fixed points ⋮ Some observations on the FGH theorem ⋮ On first-order theories with provability operator ⋮ Undecidability in diagonalizable algebras ⋮ The formalization of interpretability ⋮ A note on the interpretability logic of finitely axiomatized theories ⋮ Independent numerations of theories and recursive progressions ⋮ No escape from Vardanyan's theorem ⋮ Uniform arithmetical completeness of modal provability logics ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ Provability logic without Craig's interpolation property ⋮ Rosser and Mostowski sentences ⋮ Topological Interpretations of Provability Logic

Cites Work

• Relatively precomplete numerations and arithmetic
• Provability interpretations of modal logic
• Calculating self-referential statements
• Extremely undecidable sentences
• Unnamed Item
• Unnamed Item