𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cut-Elimination Theorem for the Logic of Constant Domains

✍ Scribed by Ryo Kashima; Tatsuya Shimura

Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
776 KB
Volume
40
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The logic CD is an intermediate logic (stronger than intuitionistic logic and weaker than classical logic) which exactly corresponds to the Kripke models with constant domains. It is known that the logic CD has a Gentzen‐type formulation called LD (which is same as LK except that (→) and (⊃–) rules are replaced by the corresponding intuitionistic rules) and that the cut‐elimination theorem does not hold for LD. In this paper we present a modification of LD and prove the cut‐elimination theorem for it. Moreover we prove a “weak” version of cut‐elimination theorem for LD, saying that all “cuts” except some special forms can be eliminated from a proof in LD. From these cut‐elimination theorems we obtain some corollaries on syntactical properties of CD: fragments collapsing into intuitionistic logic. Harrop disjunction and existence properties, and a fact on the number of logical symbols in the axiom of CD.

Mathematics Subject Classification: 03B55. 03F05.

📜 SIMILAR VOLUMES

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 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

The invariance of domain theorem for cou
The invariance of domain theorem for countably 1-set-contractive mappings
✍ Juan A. Gatica; Yun-Ho Kim 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 281 KB

The purpose of this paper is to extend the invariance of domain theorem to a large class of countably 1-γ -contractive maps, by using homotopy theory and degree theory for countably 1-γ -contractive maps.