scientific article; zbMATH DE number 4047686
From MaRDI portal
Publication:3784046
[For the entire collection see Zbl 0623.00002.] The author establishes the analogues of Craig, Robinson, and Beth theorems for a large class of propositional modal logics. The proof uses an interpretation of modal logic into classical logic, and does not depend on any deduction lemma. Thus the present method also applies to modal logics which need not be complete in the sense of Kripke.
Recommendations
Cited in
(15)- The Craig interpolation theorem for propositional logics with strong negation
- Craig's interpolation theorem for the intuitionistic logic and its extensions - a semantical approach
- On Gabbay's proof of the Craig interpolation theorem for intuitionistic predicate logic
- The decidability of Craig's interpolation property in well-composed J-logics
- Craig interpolation theorem for classical propositional logic with some probability operators
- Craig interpolation for semilinear substructural logics
- Constructive interpolation in hybrid logic
- An extended joint consistency theorem for a family of free modal logics with equality
- Linear reasoning in modal logic
- Back and forth constructions in modal logic: An interpolation theorem for a family of modal logics
- scientific article; zbMATH DE number 31597 (Why is no real title available?)
- scientific article; zbMATH DE number 125237 (Why is no real title available?)
- scientific article; zbMATH DE number 1062287 (Why is no real title available?)
- scientific article; zbMATH DE number 3893171 (Why is no real title available?)
- Analytic tableau systems and interpolation for the modal logics KB, KDB, K5, KD5
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3784046)