Cut-Free Systems for Restricted Bi-Intuitionistic Logic and Its Connexive Extension
Norihiro Kamide
Abstract
Norihiro Kamide
Abstract
In this paper, a cut-free Gentzen-type sequent calculus RBL for a restricted version of bi-intuitionistic logic is introduced as an alternative to a non-cut-free Gentzen-type sequent calculus BL for bi-intuitionistic logic. RBL is obtained from BL by imposing some restrictions to the implication-right and co-implication-left rules. RBL is a conservative extension of some Gentzen-type sequent calculi for intuitionistic and dual-intuitionistic logics. Syntactic dualities of RBL and its subsystems are also shown. Moreover, a Gentzen-type sequent calculus RBCL for a restricted version of bi-intuitionistic connexive logic, which is regarded as a variant of paraconsistent four-valued logics, is obtained from RBL by adding some initial sequents and logical inference rules for a paraconsistent negation connective. The cut-elimination theorem for RBCL is also proved using a theorem for embedding RBCL into RBL.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, a cut-free Gentzen-type sequent calculus RBL for a restricted version of bi-intuitionistic logic is introduced as an alternative to a non-cut-free Gentzen-type sequent calculus BL for bi-intuitionistic logic. RBL is obtained from BL by imposing some restrictions to the implication-right and co-implication-left rules. RBL is a conservative extension of some Gentzen-type sequent calculi for intuitionistic and dual-intuitionistic logics. Syntactic dualities of RBL and its subsystems are also shown. Moreover, a Gentzen-type sequent calculus RBCL for a restricted version of bi-intuitionistic connexive logic, which is regarded as a variant of paraconsistent four-valued logics, is obtained from RBL by adding some initial sequents and logical inference rules for a paraconsistent negation connective. The cut-elimination theorem for RBCL is also proved using a theorem for embedding RBCL into RBL.
Key concepts: Sequent calculus, Sequent, Cut-elimination theorem, Intuitionistic logic, Extension (predicate logic), Mathematics, Paraconsistent logic, Natural deduction