Extremely undecidable sentences

DOI10.2307/2273393zbMath0485.03003OpenAlexW2012650638MaRDI QIDQ3944575

George Boolos

Publication date: 1982

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

Full work available at URL: https://doi.org/10.2307/2273393

zbMATH Keywords

modal logicderivabilityPeano arithmeticmodal sentencesLindenbaum algebraarithmetic sentences

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30)

Related Items (7)

On arithmetical completeness of the logic of proofs ⋮ Generic generalized Rosser fixed points ⋮ Provability, truth, and modal logic ⋮ On explicating the concept `the power of an arithmetical theory' ⋮ Uniform arithmetical completeness of modal provability logics ⋮ The modal logic of provability. The sequential approach ⋮ The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic

Cites Work

• Provability interpretations of modal logic

This page was built for publication: Extremely undecidable sentences