Extremely undecidable sentences

DOI10.2307/2273393MaRDI QIDQ3944575zbMATH OpenOpenAlexFDO

Authors 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

arithmetic sentencesderivabilityLindenbaum algebramodal logicmodal sentencesPeano arithmetic

Mathematics Subject Classification ID

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

Cites work

• Provability interpretations of modal logic

Cited in

(8)

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

This page was built for publication: Extremely undecidable sentences

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