## 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 ✦
Frege systems for extensible modal logics
✍ Scribed by Emil Jeřábek
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 307 KB
- Volume
- 142
- Category
- Article
- ISSN
- 0168-0072
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
Modal Logics for Cryptographic Processes
✍
Ulrik Frendrup; Hans Hüttel; Jesper Nyholm Jensen
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 214 KB
Analyzing completeness of axiomatic func
✍
Alfredo Burrieza; Inmaculada P. de Guzmán; Emilio Muñoz-Velasco
📂
Article
📅
2010
🏛
John Wiley and Sons
🌐
English
⚖ 196 KB
👁 1 views
## Abstract In previous works, we presented a modification of the usual possible world semantics by introducing an independent temporal structure in each world and using accessibility functions to represent the relation among them. Different properties ofthe accessibility functions (being injective
MODAL LOGICS IN THE THEORY OF INFORMATIO
✍
Ewa Orlowska
📂
Article
📅
1984
🏛
John Wiley and Sons
🌐
English
⚖ 527 KB
Rewrite rule systems for modal propositi
✍
Annie Foret
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 885 KB
Extensions of Makinson's Completeness Th
✍
R. Routley
📂
Article
📅
1970
🏛
John Wiley and Sons
🌐
English
⚖ 890 KB