## 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
Normal derivability in modal logic
β Scribed by Jan von Plato
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 89 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
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 suggested. It is shown that both properties hold if, instead of changing the rule of necessitation, all elimination rules are formulated in the manner of disjunction elimination, i. e. with an arbitrary consequence.
π SIMILAR VOLUMES
## Abstract We consider the problem of finding, in the ambit of modal logic, a minimal characterization for finite Kripke frames, i.e., a formula which, given a frame, axiomatizes its theory employing the lowest possible number of variables and implies the other axiomatizations. We show that every
ON SOME COMPLETENESS THEOREMS IN MODAL LOGIC1) by D. MAKINSON in Oxford (England)
UPiIVERSAL FIRST-ORDER DEFINABILITY I N MODAL LOGIC by R. E. JENNIXGS and D. K. JOHNSTON in Burnaby, British Columbia (Canada) and P. K. SCHOTCH in Halifax, Nova Scotia (Canada)l) In [ l ] R. I. GOLDBLATT presents a model theoretic characterization of the class of modal sentences determined by firs