Basic Modal Logic
β Scribed by Pollock, John
- Year
- 0
- Tongue
- English
- Weight
- 1 MB
- Category
- Fiction
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## 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
## Abstract In this paper we enrich the orthomodular structure by adding a modal operator, following a physical motivation. A logical system is developed, obtaining algebraic completeness and completeness with respect to a Kripkestyle semantic founded on Baer\*βsemigroups as in [22] (Β© 2009 WILEYβV