Algorithms for relevant logic

Paul Gochet, Pascal Gribomont, Didier Rossetto


The classical analytic tableau method has been extended successfully to modal logics (see e.g. [3, 4, 51) and also to relevant and paraconsistent logics [1, 2]. The classical connection method has been extended to modal and intuitionistic logics [10], and the purpose of this paper is to investigate whether a similar adaptation to relevant logic is possible. A hybrid method is developed for B+ with a specific solution to the "multiplicity problem", as in the technique of modal semantic diagrams introduced in [7]. Proofs of soundness and completeness are also given.

Full Text:



  • There are currently no refbacks.