✦ LIBER ✦

Cut-elimination Theorems for Some Infinitary Modal Logics

✍ Scribed by Yoshihito Tanaka

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 189 KB
Volume: 47
Category: Article
ISSN: 0044-3050
DOI: 10.1002/1521-3870(200108)47:3<327::aid-malq327>3.0.co;2-p

No coin nor oath required. For personal study only.

✦ Synopsis

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 standard sense. We prove the cut-elimination theorem for TLMω 1 via its Kripke completeness.

📜 SIMILAR VOLUMES

On Some Completeness Theorems in Modal L

On Some Completeness Theorems in Modal Logic

✍ D. Makinson 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 369 KB

ON SOME COMPLETENESS THEOREMS IN MODAL LOGIC1) by D. MAKINSON in Oxford (England)

Barwise Completeness Theorems for Some B

Barwise Completeness Theorems for Some Biprobability Logics

✍ M. Rašković; R. Živaljević 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB

A local normal form theorem for infinita

A local normal form theorem for infinitary logic with unary quantifiers

✍ H. Jerome Keisler; Wafik Boulos Lotfallah 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB

We prove a local normal form theorem of the Gaifman type for the infinitary logic L∞ω(Q u ) ω whose formulas involve arbitrary unary quantifiers but finite quantifier rank. We use a local Ehrenfeucht-Fraïssé type game similar to the one in [9]. A consequence is that every sentence of L∞ω(Q u ) ω of

An Omitting Types Theorem for first orde

An Omitting Types Theorem for first order logic with infinitary relation symbols

✍ Tarek Sayed Ahmed; Basim Samir 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract In this paper, an extension of first order logic is introduced. In such logics atomic formulas may have infinite lengths. An Omitting Types Theorem is proved. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

A new technique for proving realisabilit

A new technique for proving realisability and consistency theorems using finite paraconsistent models of cut-free logic

✍ Arief Daynes 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

## Abstract A new technique for proving realisability results is presented, and is illustrated in detail for the simple case of arithmetic minus induction. CL is a Gentzen formulation of classical logic. CPQ is CL minus the Cut Rule. The basic proof theory and model theory of CPQ and CL is develope