## Abstract We present sequent calculi for normal modal logics where modal and propositional behaviours are separated, and we prove a cut elimination theorem for the basic system K, so as completeness theorems (in the new style) both for K itself and for its most popular enrichments. MSC: 03B45, 03
Amalgamation and interpolation in normal modal logics
✍ Scribed by Larisa Maksimova
- Publisher
- Springer Netherlands
- Year
- 1991
- Tongue
- English
- Weight
- 740 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0039-3215
No coin nor oath required. For personal study only.
✦ Synopsis
This is a survey of results on interpolation in propositional normal modal logics. Interpolation properties of these logics are closely connected with amalgamation properties of varieties of modal algebras. Therefore, the results on interpolation are also reformulated in terms of amalgamation.
📜 SIMILAR VOLUMES
The standard rule of necessitation in systems of natural deduction for the modal logic S4 concludes A from A whenever all assumptions A depends on are modal formulas. This condition prevents the composability and normalization of derivations, and therefore modifications of the rule have been suggest
Quantiÿed hybrid logic is quantiÿed modal logic extended with apparatus for naming states and asserting that a formula is true at a named state. While interpolation and Beth's deÿnability theorem fail in a number of well-known quantiÿed modal logics (for example in quantiÿed modal K, T, D, S4, S4.3
We extend Makkai's proof of strong amalgamation (push-outs of monos along arbitrary maps are monos) from the category of Heyting algebras to a class which includes the categories of symmetric bounded distributive lattices, symmetric Heyting algebras, Heyting modal S4-algebras, Heyting modal bi-S4-al