✦ LIBER ✦

Quick cut-elimination for strictly positive cuts

✍ Scribed by Toshiyasu Arai

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 259 KB
Volume: 162
Category: Article
ISSN: 0168-0072
DOI: 10.1016/j.apal.2011.03.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cut-elimination theorem for relevant log

Cut-elimination theorem for relevant logics

✍ G. E. Mints 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 427 KB

A cut elimination theorem for stationary

A cut elimination theorem for stationary logic

✍ M.E. Szabo 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 975 KB

CUT ELIMINATION FOR PROPOSITIONAL DYNAMI

CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT

✍ Robert A. Bull 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 764 KB

## Abstract The aim of this paper is to extend the semantic analysis of tense logic in Rescher/Urquhart [3] to propositional dynamic logic without\*. For this we develop a nested sequential calculus whose axioms and rules directly reflect the steps in the semantic analysis. It is shown that this ca

Cut-elimination and interpolation for Ω-

Cut-elimination and interpolation for Ω-logic

✍ Jacqueline Vauzeilles 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 679 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

A Syntactic Proof of Cut-Elimination For

A Syntactic Proof of Cut-Elimination For GLlin

✍ S. Valentini 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB