A modal reduction for partial logic
โ Scribed by Juan Barba
- Publisher
- Springer Netherlands
- Year
- 1993
- Tongue
- English
- Weight
- 293 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0022-3611
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
In this paper we introduce DML: Default Modal Logic. DML is a logic endowed with a two-place modal connective that has the intended meaning of "If ฮฑ, then normally ฮฒ". On top of providing a well-defined tool for analyzing common default reasoning, DML allows nesting of the default operator. We prese
We view models of rewrite theories enriched with observations coalgebraically. This allows us on the one hand to use "off the shelf" logics for coalgebras to specify and, on the other hand, to verify properties of rewriting programs and to obtain results about the expressive power of such languages.
Edited By Dale Jacquette. Includes Bibliographical References And Index.