## 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
✦ LIBER ✦
Deep sequent systems for modal logic
✍ Scribed by Kai Brünnler
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 644 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0933-5846
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Modal sequents for normal modal logics
✍
Claudio Cerrato
📂
Article
📅
1993
🏛
John Wiley and Sons
🌐
English
⚖ 433 KB
Sequent systems for compact bilinear log
✍
Wojciech Buszkowski
📂
Article
📅
2003
🏛
John Wiley and Sons
🌐
English
⚖ 118 KB
## Abstract Compact Bilinear Logic (CBL), introduced by Lambek [14], arises from the multiplicative fragment of Noncommutative Linear Logic of Abrusci [1] (also called Bilinear Logic in [13]) by identifying times with par and 0 with 1. In this paper, we present two sequent systems for CBL and prove
A Deep Inference System for the Modal Lo
✍
Phiniki Stouppa
📂
Article
📅
2007
🏛
Springer Netherlands
🌐
English
⚖ 626 KB
Rewrite rule systems for modal propositi
✍
Annie Foret
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 885 KB
Frege systems for extensible modal logic
✍
Emil Jeřábek
📂
Article
📅
2006
🏛
Elsevier Science
🌐
English
⚖ 307 KB
Modal extension of logic programming sys
✍
A. V. Pozharskii
📂
Article
📅
1994
🏛
Springer US
🌐
English
⚖ 295 KB