𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity Results for Modal Dependence Logic

✍ Scribed by Peter Lohmann, Heribert Vollmer

Book ID
120780377
Publisher
Springer Netherlands
Year
2013
Tongue
English
Weight
332 KB
Volume
101
Category
Article
ISSN
0039-3215

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Recursive complexity of the Carnap first
Recursive complexity of the Carnap first order modal logic C
✍ AmΓ©lie Gheerbrant; Marcin Mostowski πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 134 KB

We consider first order modal logic C firstly defined by Carnap in "Meaning and Necessity" [1]. We prove elimination of nested modalities for this logic, which gives additionally the Skolem-LΓΆwenheim theorem for C. We also evaluate the degree of unsolvability for C, by showing that it is exactly 0 .

Modal sequents for normal modal logics
Modal sequents for normal modal logics
✍ Claudio Cerrato πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 433 KB

## 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