TY - CHAP
T1 - A tree derivation procedure for multivalent and paraconsistent inference
AU - Anderson, David
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
M3 - Chapter (peer-reviewed)
SN - 9780387854373
T3 - Lecture notes in electrical engineering
SP - 651
EP - 657
BT - Proceedings of the European Computing Conference. Vol. 2
A2 - Mastorakis, N.
A2 - Mladenov, V.
A2 - Kontargyri, V.
PB - Springer
CY - Boston, Mass.
ER -