Barwise's information frames and modal logics
β Scribed by V.V. Rybakov
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Weight
- 211 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0933-5846
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## I I n [loll) MCKIYSEY and TAXSKI define a translation T from wffs of propositional calculus into wffs of modal logic, and prove (Thm. 5.1) that F I c n iff Fs4 T (a), where 1C is the intuitionist calculus. We wish to investigate the relation between any system PA of propositional calculus forme
## 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