✦ LIBER ✦

Modal Logics for Cryptographic Processes

✍ Scribed by Ulrik Frendrup; Hans Hüttel; Jesper Nyholm Jensen

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 214 KB
Volume: 68
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80368-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Frege systems for extensible modal logic

Frege systems for extensible modal logics

✍ Emil Jeřábek 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 307 KB

Cut-elimination Theorems for Some Infini

Cut-elimination Theorems for Some Infinitary Modal Logics

✍ Yoshihito Tanaka 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB

In this article, a cut-free system TLMω 1 for infinitary propositional modal logic is proposed which is complete with respect to the class of all Kripke frames. The system TLMω 1 is a kind of Gentzen style sequent calculus, but a sequent of TLMω 1 is defined as a finite tree of sequents in a standar

Sheffer functions for many-valued S5 mod

Sheffer functions for many-valued S5 modal logics

✍ Gerald J. Massey 📂 Article 📅 1969 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

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.