The analytical completeness of Dzhaparidze's polymodal logics
The bimodal propositional system GLP introduced by G. Dzhaparidze in 1985 has \(\square (A\to B)\to (\square A\to \square B)\), \(\boxdot (A\to B)\to (\boxdot A\to \boxdot B)\), \(\square(\square A\to A)\to \square A\), \(\boxdot(\boxdot A\to A)\to \boxdot A\), \(\square A\to \boxdot A\), \(\neg\square A\to \boxdot\neg\square A\), and all classical tautologies as its axioms. Inference rules are modus ponens and \(\square\)-necessitation \(A/\square A\). Dzhaparidze proved arithmetical completeness of GLP with respect to reading \(\square\) and \(\boxdot\) as `is provable' and `has an \(\omega\)-inconsistent negation'. The author proves completeness of GLP with respect to reading \(\square\) and \(\boxdot\) as `is provable in second-order arithmetic' and `is provable in second-order arithmetic with \(\omega\)-rule'.
- Elementary induction on abstract structures
- scientific article; zbMATH DE number 47306 (Why is no real title available?)
- scientific article; zbMATH DE number 1176133 (Why is no real title available?)
- scientific article; zbMATH DE number 4195937 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- On the proof of Solovay's theorem
- Provability interpretations of modal logic
This page was built for publication: The analytical completeness of Dzhaparidze's polymodal logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685073)