Paraconsistent Double Negation That Can Simulate Classical Negation
Norihiro Kamide
Abstract
Norihiro Kamide
Abstract
A new classical paraconsistent logic (CP), which is a variant of Nelson's paraconsistent four-valued logic, is introduced as a Gentzen-type sequent calculus. The logic CP can simulate the classical negation in classical logic by paraconsistent double negation in CP. Some theorems for syntactically and semantically embedding CP into a Gentzen-type sequent calculus LK for classical logic and vice versa are proved. The cut-elimination and completeness theorems for CP are also shown using these embedding theorems.
OpenAlex reports 9 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.
A new classical paraconsistent logic (CP), which is a variant of Nelson's paraconsistent four-valued logic, is introduced as a Gentzen-type sequent calculus. The logic CP can simulate the classical negation in classical logic by paraconsistent double negation in CP. Some theorems for syntactically and semantically embedding CP into a Gentzen-type sequent calculus LK for classical logic and vice versa are proved. The cut-elimination and completeness theorems for CP are also shown using these embedding theorems.
Key concepts: Paraconsistent logic, Sequent calculus, Negation, Sequent, Intuitionistic logic, Classical logic, Cut-elimination theorem, Mathematics