✦ LIBER ✦

Modal sequents for normal modal logics

✍ Scribed by Claudio Cerrato

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 433 KB
Volume: 39
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19930390127

No coin nor oath required. For personal study only.

✦ Synopsis

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, 03F05.

📜 SIMILAR VOLUMES

Modal Tree-Sequents

✍ Claudio Cerrato 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 613 KB

## Abstract We develop cut‐free calculi of sequents for normal modal logics by using treesequents, which are trees of sequences of formulas. We introduce modal operators corresponding to the ways we move formulas along the branches of such trees, only considering fixed distance movements. Finally,

Normal derivability in modal logic

✍ Jan von Plato 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB

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

Negation-Free Modal Logics

✍ George F. Schumm; Roy Edelstein 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 521 KB

3-SAT = SAT for a class of normal modal

3-SAT = SAT for a class of normal modal logics

✍ Stéphane Demri 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 821 KB

Classically complete modal relevant logi

Classically complete modal relevant logics

✍ Edwin D. Mares 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 674 KB

## Abstract A variety of modal logics based on the relevant logic R are presented. Models are given for each of these logics and completeness is shown. It is also shown that each of these logics admits Ackermann's rule γ and as a corollary of this it is proved that each logic is a conservative exte

The completeness of monotonic modal logi

The completeness of monotonic modal logics

✍ Brian F. Chellas; Audrey McKinney 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 379 KB

The purpose of this paper is to point out an error in KRISTER SEGERBERG'S proof of the completeness of the modal logic R, and to provide a correct proof.2) The correct proofbased on a notion and a strategy suggested by SEOERBERO'S techniquesintroduces a general approach for obtaining completeness th