Bisequent Calculus for Four-Valued Quasi-Relevant Logics: Cut Elimination and Interpolation

Abstract

AbstractWe present a uniform syntactical characterisation of the class of quasi-relevant logics which are four-valued extensions of the basic relevant logic B of Meyer and Routley. All these logics are obtained by the addition of suitable quasi-relevant implications to the four-valued logic of First Degree Entailment FDE. So far they were characterised axiomatically and semantically in several ways but did not obtain a special proof-theoretic treatment. To this aim a generalised form of sequent calculus called bisequent calculus (BSC) is applied. In BSC rules operate on the ordered pairs of ordinary sequents. It may be treated as the weakest kind of system in the rich family of generalised sequent calculi operating on items which are some collections of ordinary sequents, like hypersequents or nested sequents. It is shown that all logics under consideration have cut-free characterisation in BSC which satisfies the subformula property and yields decidability. It is also shown that the interpolation theorem holds for these logics if their language is enriched with additional negation.