A simple proof of arithmetical completeness for _ 1-conservativity logic
From MaRDI portal
Publication:1893136
DOI10.1305/NDJFL/1040511342zbMATH Open0822.03013OpenAlexW2047679686MaRDI QIDQ1893136FDOQ1893136
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Provability interpretations of modal logic
- Handbook of mathematical logic. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, A. S. Troelstra. 2nd printing
- Title not available (Why is that?)
- Title not available (Why is that?)
- The interpretability logic of Peano arithmetic
- The logic of \(\Pi_ 1\)-conservativity
- A generalized notion of weak interpretability and the corresponding modal logic
- On the proofs of arithmetical completeness for interpretability logic
- The logic of linear tolerance
Cited In (10)
- The logic of tasks
- A simple proof of a completeness result for \(leads\)-\(to\) in the UNITY logic
- Transductions in arithmetic
- Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
- The logic of \(\Pi_ 1\)-conservativity
- An overview of Verbrugge semantics, a.k.a. generalised Veltman semantics
- A simplified proof of arithmetical completeness theorem for provability logic GLP
- The logic of \(\Pi_ 1\)-conservativity continued
- On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
- A few questions concerning consistency and conservativeness
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)