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, but will, with slight modification, work generally.
|Title of host publication||Proceedings of the European Computing Conference. Vol. 2|
|Editors||N. Mastorakis, V. Mladenov, V. Kontargyri|
|Place of Publication||Boston, Mass.|
|Number of pages||7|
|Publication status||Published - 2009|
|Name||Lecture notes in electrical engineering|