Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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, Florida
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix: Matrices for Epsilon 442
Appendix: Matrices for Epsilon 442
NB. In Epsilon 442, {1,3} are designated values, {2} is anti-designated and {4} is non-designated.
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this paper
Cite this paper
Anderson, D. (2009). A Tree Derivation Procedure for Multivalent and Paraconsistent Inference. In: Mastorakis, N., Mladenov, V., Kontargyri, V. (eds) Proceedings of the European Computing Conference. Lecture Notes in Electrical Engineering, vol 28. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-85437-3_67
Download citation
DOI: https://doi.org/10.1007/978-0-387-85437-3_67
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-84818-1
Online ISBN: 978-0-387-85437-3
eBook Packages: EngineeringEngineering (R0)