A simple proof of arithmetical completeness for \(\Pi_ 1\)-conservativity logic

DOI10.1305/ndjfl/1040511342zbMath0822.03013OpenAlexW2047679686MaRDI QIDQ1893136

Giorgi Japaridze

Publication date: 3 July 1995

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1040511342

zbMATH Keywords

\(\Pi_ 1\)-conservativitymodal propositional logic ILM

Mathematics Subject Classification ID

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

Related Items (4)

Transductions in arithmetic ⋮ On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories ⋮ The logic of tasks ⋮ HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalized notion of weak interpretability and the corresponding modal logic
• On the proofs of arithmetical completeness for interpretability logic
• The logic of \(\Pi_ 1\)-conservativity
• Handbook of mathematical logic. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, A. S. Troelstra. 2nd printing
• The logic of linear tolerance
• Provability interpretations of modal logic
• The interpretability logic of Peano arithmetic

This page was built for publication: A simple proof of arithmetical completeness for \(\Pi_ 1\)-conservativity logic