Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic

Abstract

Bi-intuitionistic logic is the union of intuitionistic and dual intuitionistic logic, and was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent ‘cut-free’ sequent calculus has recently been shown to fail cut-elimination. We present a new cut-free sequent calculus for bi-intuitionistic logic, and prove it sound and complete with respect to its Kripke semantics. Ensuring completeness is complicated by the interaction between intuitionistic implication and dual intuitionistic exclusion, similarly to future and past modalities in tense logic. Our calculus handles this interaction using derivations and refutations as first class citizens. We employ extended sequents which pass information from premises to conclusions using variables instantiated at the leaves of refutations, and rules which compose certain refutations and derivations to form derivations. Automated deduction using terminating backward search is also possible, although this is not our main purpose.

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,694

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2010-09-22

Downloads
9 (#958,211)

6 months
1 (#388,319)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references

Similar books and articles

Gentzen's Proof Systems: Byproducts in a Work of Genius.Jan von Plato - 2012 - Bulletin of Symbolic Logic 18 (3):313-367.
Varieties of Linear Calculi.Sara Negri - 2002 - Journal of Philosophical Logic 31 (6):569-590.
Negationless Intuitionism.Enrico Martino - 1998 - Journal of Philosophical Logic 27 (2):165-177.
Phase Semantics and Petri Net Interpretation for Resource-Sensitive Strong Negation.Norihiro Kamide - 2006 - Journal of Logic, Language and Information 15 (4):371-401.