Abstract
We provide non-deterministic semantics for the 3 basic paraconsistent C-systems C (also known as bC), Ci, and Cia, as well as to all 9 extensions of them by one or two of the schemata (l) ¬(φΛ¬φ) ⊃ ∘ φ and (e) φ ⊃ ¬¬φ. This includes da Costa’s original C 1 (which is equivalent to Cila). Our semantics is 3-valued for the systems without (l), and infinite-valued for the systems with it. We prove that these results cannot be improved: neither of the systems without (l) has either a finite characteristic ordinary matrix or a two-valued characteristic non-deterministic matrix, and neither of the systems with (l) has a finite characteristic non-deterministic matrix. Still, our semantics suffices for providing decision procedures for all the systems investigated.
This research was supported by THE ISRAEL SCIENCE FOUNDATION founded by The Israel Academy of Sciences and Humanities.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avron, A., Lev, I.: Canonical Propositional Gentzen-Type Systems. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 529–544. Springer, Heidelberg (2001)
Avron, A., Lev, I.: Non-deterministic Matrices. In: Proceedings of the 34th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2004), pp. 282–287. IEEE Computer Society Press, Los Alamitos (2004)
Avron, A., Lev, I.: Non-deterministic Multiple-valued Structures. To appear in the Journal of Logic and Computation
Batens, D., De Clercq, K., Kurtonina, N.: Embedding and Interpolation for Some Paralogics. The Propositional Case, Reports on Mathematical Logic 33, 29–44 (1999)
Batens, D., Mortensen, C., Priest, G., Van Bendegem, J.P. (eds.): Frontiers of Paraconsistent Logic. King’s College Publications, Research Studies Press, Baldock (2000)
Bremer, M.: An Introduction to Paraconsistent Logics. Peter Lang GmbH (2005)
Carnielli, W.A.: Possible-translations Semantics for Paraconsistent Logics. [5], 149–163
Crawford, J.M., Etherington, D.W.: A Non-deterministic Semantics for Tractable Inference. In: Proc. of the 15th International Conference on Artificial Intelligence and the 10th Conference on Innovative Applications of Artificial Intelligence, pp. 286–291. MIT Press, Cambridge (1998)
Carnielli, W.A., Marcos, J.: A Taxonomy of C-systems. [11], 1–94
Carnielli, W.A., Coniglio, M.E., Marcos, J.: Logics of Formal Inconsistency. In: Gabbay, D., Guenthner, F. (eds.) To appear in Handbook of Philosophical Logic, 2nd edn. Kluwer Academic Publishers, Dordrecht (2005)
Carnielli, W.A., Coniglio, M.E., D’ottaviano, I.L.M. (eds.): Paraconsistency — the logical way to the inconsistent. Lecture Notes in Pure and Applied Mathematics. Marcel Dekker (2002)
da Costa, N.C.A.: On the theory of inconsistent formal systems. Notre Dame Journal of Formal Logic 15, 497–510 (1974)
da Costa, N.C.A., Krause, D., Bueno, O.: Paraconsistent Logics and Paraconsistency: Technical and Philosophical Developments. In: Jacquette, D. (ed.) Philosophy of Logic, North-Holland, Amsterdam (to appear)
Delgrande, J.P., Mylopoulos, J.: Knowledge Representation: Features of Knowledge. In: Haton, J.P. (ed.) Fundamentals in Man-Machine Communication: Speech, Vision, and Natural Language, Cambridge University Press, Cambridge (1986); Bibel, W., et al.(eds.) Reprinted in Fundamentals of Artificial Intelligence pp. 1–36, Springer, Heidelberg (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avron, A. (2005). Non-deterministic Semantics for Paraconsistent C-Systems. In: Godo, L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2005. Lecture Notes in Computer Science(), vol 3571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11518655_53
Download citation
DOI: https://doi.org/10.1007/11518655_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27326-4
Online ISBN: 978-3-540-31888-0
eBook Packages: Computer ScienceComputer Science (R0)