✦ LIBER ✦

Modal Tree-Sequents

✍ Scribed by Claudio Cerrato

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 613 KB
Volume: 42
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19960420117

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We develop cut‐free calculi of sequents for normal modal logics by using treesequents, which are trees of sequences of formulas. We introduce modal operators corresponding to the ways we move formulas along the branches of such trees, only considering fixed distance movements. Finally, we exhibit syntactic cut‐elimination theorems for all the main normal modal logics.

Mathematics Subject Classification: 03B45, 03F05.

📜 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

On modal mu-calculus and Büchi tree auto

On modal mu-calculus and Büchi tree automata

✍ Roope Kaivola 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 500 KB

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

Sequent systems for compact bilinear log

Sequent systems for compact bilinear logic

✍ Wojciech Buszkowski 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

## Abstract Compact Bilinear Logic (CBL), introduced by Lambek [14], arises from the multiplicative fragment of Noncommutative Linear Logic of Abrusci [1] (also called Bilinear Logic in [13]) by identifying times with par and 0 with 1. In this paper, we present two sequent systems for CBL and prove

Dual-Context Sequent Calculus and Strict

Dual-Context Sequent Calculus and Strict Implication

✍ Kentaro Kikuchi 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

Translations from natural deduction to s

Translations from natural deduction to sequent calculus

✍ Jan von Plato 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 96 KB

## Abstract Gentzen's “Untersuchungen” [1] gave a translation from natural deduction to sequent calculus with the property that normal derivations may translate into derivations with cuts. Prawitz in [8] gave a translation that instead produced cut‐free derivations. It is shown that by writing all