Substructural logics are traditionally obtained by dropping some or all of the structural rules from Gentzen's sequent calculi LK or LJ. It is well known that the usual logical connectives then split into more than one connective. Alternatively, one can start with the Lambek calculus, which contains these multiple connectives, and obtain numerous logics like: exponential-free linear logic, relevant logic, BCK logic, and intuitionistic logic, in an incremental way. Each of these logics also has a…
Read moreSubstructural logics are traditionally obtained by dropping some or all of the structural rules from Gentzen's sequent calculi LK or LJ. It is well known that the usual logical connectives then split into more than one connective. Alternatively, one can start with the Lambek calculus, which contains these multiple connectives, and obtain numerous logics like: exponential-free linear logic, relevant logic, BCK logic, and intuitionistic logic, in an incremental way. Each of these logics also has a classical counterpart, and some also have a 'cyclic' counterpart. These logics have been studied extensively and are quite well understood.Generalising further, one can start with intuitionistic Bi-Lambek logic, which contains the dual of every connective from the Lambek calculus. The addition of the structural rules then gives Bi-linear, Bi-relevant, Bi-BCK and Bi-intuitionistic logic, again in an incremental way. Each of these logics also has a classical counterpart, and some even have a 'cyclic' counterpart. These extensions of Bi-Lambek logic are not so well understood. Cut-elimination for Classical Bi-Lambek logic, for example, is not completely clear since some cut rules have side conditions requiring that certain constituents be empty or non-empty.The display logic of Nuel Belnap is a general Gentzen-style proof theoretical framework designed to capture many different logics in one uniform setting. The beauty of display logic is a general cut-elimination theorem, due to Belnap, which applies whenever the rules of the display calculus obey certain, easily checked, conditions. The original display logic, and its various incarnations, are not suitable for capturing bi-intuitionistic and bi-classical logics in a uniform way. We remedy this situation by giving a single Display calculus for the Bi-Lambek Calculus, from which all the well-known extensions are obtained by the incremental addition of structural rules to a constant core of logical introduction rules.We highlight the inherent duality and symmetry within this framework obtaining 'four proofs for the price of one'. We give algebraic semantics for the Bi-Lambek logics and prove that our calculi are sound and complete with respect to these semantics. We show how to define an alternative display calculus for bi-classical substructural logics using negations, instead of implications, as primitives.Borrowing from other display calculi, we show how to extend our display calculus to handle bi-intuitionistic or bi-classical substructural logics containing the forward and backward modalities familiar from tense logic, the exponentials of linear logic, the converse operator familiar from relation algebra, four negations, and two unusual modalities corresponding to the non-classical analogues of Sheffer's 'dagger' and 'stroke', all in a modular way.Using the Gaggle Theory of Dunn we outline relational semantics for the binary and unary intensional connectives, but make no attempt to do so for the extensional connectives, or the exponentials.Finally, we flesh out a suggestion of Lambek to embed intuitionistic logic using two unusual 'exponentials', and show that these 'exponentials' are essentially tense logical modalities, quite at odds with the usual exponentials.Using a refinement of the display property, you can pick and choose from these possibilities to construct a display calculus for your needs.
