DeepAI AI Chat
Log In Sign Up

A cut-free sequent calculus for the bi-intuitionistic logic 2Int

by   Sara Ayhan, et al.

The purpose of this paper is to introduce a bi-intuitionistic sequent calculus and to give proofs of admissibility for its structural rules. The calculus I will present, called SC2Int, is a sequent calculus for the bi-intuitionistic logic 2Int. Calculi for this logic represent a kind of bilateralist reasoning, since they do not only internalize processes of verification or provability but also the dual processes in terms of falsification or what is called dual provability. A normal form theorem for a natural deduction calculus of 2Int has already been stated, in this paper I want to prove a cut-elimination theorem for SC2Int, i.e. if successful, this would extend the results existing so far.


page 1

page 2

page 3

page 4


Semantic Cut Elimination for the Logic of Bunched Implications, Formalized in Coq

The logic of bunched implications (BI) is a substructural logic that for...

Efficient elimination of Skolem functions in first-order logic without equality

We prove that elimination of a single Skolem function in pure logic incr...

A Resolution Prover for Coalition Logic

We present a prototype tool for automated reasoning for Coalition Logic,...

Gentzen-Mints-Zucker duality

The Curry-Howard correspondence is often described as relating proofs (i...

Semantical Analysis of the Logic of Bunched Implications

We give a novel approach to proving soundness and completeness for a log...

A Curry-Howard Correspondence for the Minimal Fragment of Łukasiewicz Logic

In this paper we introduce a term calculus B which adds to the affine λ...

A Complete Axiomatisation for Quantifier-Free Separation Logic

We present the first complete axiomatisation for quantifier-free separat...