A Tree Derivation Procedure for Multivalent and Paraconsistent Inference

  • David Anderson
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 28)


The use of trees as a derivation procedure, which is a refinement of Beth’s semantic tableaux method and Gentzen’s sequent calculus, is an elegant and well established technique. Despite widespread acceptance and application, little effort has been made to extend the use of tree derivation procedures to multivalent alternatives to classical logic and none at all, so far as I am aware, to paraconsistent systems. The purpose of this paper is to outline briefly a single tree derivation procedure which was designed to work with a particular multi-valued paraconsistent system: Epsilon442 [1], but will, with slight modification, work generally.


Sequent Calculus Valid Inference Tree Derivation Classical Propositional Logic Original Conclusion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Anderson CDP (2002) Developing a framework for investigating inconsistency handling in automated reasoning. In: 6th World Multi-Conference on Systemics, Cybernetics and Informatics (SCI 2002), Orlando, FloridaGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.School of ComputingUniversity of PortsmouthUK

Personalised recommendations