Minimal Axiomatization in Modal Logic
โ Scribed by Fabio Bellissima; Saverio Cittadini
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 700 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
โฆ Synopsis
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 finite transitive frame admits a minimal characterization over K4, and that this result can not be extended to K.
๐ SIMILAR VOLUMES
## 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
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
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