✦ LIBER ✦

Full Models for Positive Modal Logic

✍ Scribed by Ramon Jansana

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 267 KB
Volume: 48
Category: Article
ISSN: 0044-3050
DOI: 10.1002/1521-3870(200204)48:3<427::aid-malq427>3.0.co;2-t

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coalgebraic Semantics for Positive Modal

Coalgebraic Semantics for Positive Modal Logic

✍ Alessandra Palmigiano 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Models for relevant modal logics

✍ André Fuhrmann 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 789 KB

Semantics are given for modal extensions of relevant logics based on the kind of frames introduced in I-7]. By means of a simple recipe we may obtain from a class FRM (L) of unreduced frames characterising a (non-modal) logic L, frame-classes FRM m (L:M) eharacterising conjunctively regular modal ex

Conceptual modeling in full computation-

Conceptual modeling in full computation-tree logic with sequence modal operator

✍ Ken Kaneiwa; Norihiro Kamide 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB

In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS \* , is introduced as a Kripke semantics with a sequence modal operator. This logic can appropriately represent hierarchical tree struc

Definability, Canonical Models, Compactn

Definability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic

✍ Alexander Kurz; Dirk Pattinson 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 307 KB

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

Modal Logic for Rewriting Theories

✍ Dirk Pattinson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 203 KB

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.