A simple proof of arithmetical completeness for _ 1-conservativity logic

DOI10.1305/NDJFL/1040511342MaRDI QIDQ1893136zbMATHOpenAlexFDO

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

Recommendations

• The logic of \(\Pi_ 1\)-conservativity
• The logic of \(\Pi_ 1\)-conservativity continued
• On the \(\Sigma{}^ 0_ 1\)-conservativity of \(\Sigma{}^ 0_ 1\)- completeness

Cites work

• scientific article; zbMATH DE number 1170091 (Why is no real title available?)
• scientific article; zbMATH DE number 218496 (Why is no real title available?)
• scientific article; zbMATH DE number 218514 (Why is no real title available?)
• A generalized notion of weak interpretability and the corresponding modal logic
• Handbook of mathematical logic. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, A. S. Troelstra. 2nd printing
• On the proofs of arithmetical completeness for interpretability logic
• Provability interpretations of modal logic
• The interpretability logic of Peano arithmetic
• The logic of \(\Pi_ 1\)-conservativity
• The logic of linear tolerance

Cited in

(10)

• Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
• An overview of Verbrugge semantics, a.k.a. generalised Veltman semantics
• The logic of \(\Pi_ 1\)-conservativity
• The logic of tasks
• A simplified proof of arithmetical completeness theorem for provability logic GLP
• On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
• A few questions concerning consistency and conservativeness
• Transductions in arithmetic
• The logic of \(\Pi_ 1\)-conservativity continued
• A simple proof of a completeness result for \(leads\)-\(to\) in the UNITY logic

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

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