| dc.creator | Carnielli W. | |
| dc.creator | Matulovic M. | |
| dc.date | 2014 | |
| dc.date | 2015-06-25T17:53:29Z | |
| dc.date | 2015-11-26T14:23:24Z | |
| dc.date | 2015-06-25T17:53:29Z | |
| dc.date | 2015-11-26T14:23:24Z | |
| dc.date.accessioned | 2018-03-28T21:25:23Z | |
| dc.date.available | 2018-03-28T21:25:23Z | |
| dc.identifier | | |
| dc.identifier | Electronic Notes In Theoretical Computer Science. Elsevier, v. 305, n. , p. 19 - 34, 2014. | |
| dc.identifier | 15710661 | |
| dc.identifier | 10.1016/j.entcs.2014.06.003 | |
| dc.identifier | http://www.scopus.com/inward/record.url?eid=2-s2.0-84903961945&partnerID=40&md5=ab2d22b053033efb17c208aa70d56940 | |
| dc.identifier | http://www.repositorio.unicamp.br/handle/REPOSIP/86466 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/86466 | |
| dc.identifier | 2-s2.0-84903961945 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1245096 | |
| dc.description | The method for automatic theorem proving proposed in [Carnielli, W. A., Polynomial ring calculus for many-valued logics, Proceedings of the 35th International Symposium on Multiple-Valued Logic, IEEE Computer Society. Calgary, Canada (2005), 20-25], called Polynomial Ring Calculus, is an algebraic proof mechanism based on handling polynomials over finite fields. Although useful in general domains, as in first-order logic, certain non-truth-functional logics and even in modal logics (see [Agudelo, J. C., Carnielli, W. A., Polynomial Ring Calculus for Modal Logics: a new semantics and proof method for modalities, The Review of Symbolic Logic. 4 (2011), 150-170, URL: doi:10.1017/S1755020310000213]), the method is particularly apt for deterministic and non-deterministic many-valued logics, as shown here. The aim of the present paper is to show how the method can be extended to any finite-valued non-deterministic semantics, and also to explore the computational character of the method through the development of a software capable of translating provability in deterministic and non-deterministic finite-valued logical systems into operations on polynomial rings. © 2014 Elsevier B.V. | |
| dc.description | 305 | |
| dc.description | | |
| dc.description | 19 | |
| dc.description | 34 | |
| dc.description | Agudelo, J.C., Carnielli, W.A., Polynomial Ring Calculus for Modal Logics: A new semantics and proof method for modalities (2011) The Review of Symbolic Logic, 4, pp. 150-170. , 10.1017/S1755020310000213 | |
| dc.description | Avron, A., Non-deterministic Semantics for Logics with a Consistency Operator (2007) Journal of Approximate Reasoning., 45, pp. 271-287 | |
| dc.description | Bimbó, K., Dunn, J.M., Generalized Galois Logics: Relational Semantics of Nonclassical Logical Calculi (2008) CSLI Lecture Notes, , CSLI Publications | |
| dc.description | Carnielli, W.A., Possible-translations semantics for paraconsistent logics (1998) Frontiers in Paraconsistent Logic: Proceedings of the i World Congress on Paraconsistency, Ghent, p. 15972. , D. Batens, Kings College Publications 2000 | |
| dc.description | Carnielli, W.A., A polynomial proof system for Łukasiewicz logics (2001) Second Principia International Symposium, pp. 6-10 | |
| dc.description | Carnielli, W.A., Polynomial ring calculus for many-valued logics (2005) Proceedings of the 35th International Symposium on Multiple-Valued Logic, pp. 20-25. , IEEE Computer Society Calgary, Canada | |
| dc.description | Carnielli, W.A., Polynomial Ring Calculus for Logical Inference (2005) CLE E-Prints, 5, pp. 1-17. , ftp://ftp.cle.unicamp.br/pub/e-prints/vol.5,n.3,2005.pdf | |
| dc.description | Carnielli, W.A., (2007) Polynomizing: Logic Inference in Polynomial Format and the Legacy of Boole, Model-Based Reasoning in Science, Technology, and Medicine, 64, pp. 349-364. , L. Magnani, P. Li (Eds.) Springer publisher | |
| dc.description | Carnielli, W.A., Coniglio, M.E., Marcos, J., Logics of Formal Inconsistency (2007) Handbook of Philosophical Logic, 14, pp. 15-107. , D. Gabbay, F. Guenthner (Eds.) | |
| dc.description | Carnielli, W.A., (2009) Formal Polynomials and the Laws of Form, the Multiple Dimensions of Logic, 54, pp. 2002-2012. , Y. Béziau, A. Costa-Leite | |
| dc.description | Carnielli, W.A., Formal polynomials, heuristics and proofs in logic, Logical Investigations (2010) Institute of Philosophy - Russian Academy of Sciences Publisher, 16, pp. 280-294. , A.S. Karpenko (Ed.) | |
| dc.description | Carnielli, W.A., Proofs by handling polynomials: A tool for teaching logic and metalogic (2011) Proceedings of the Third International Congress on Tools for Teaching Logic, pp. 1-3. , Salamanca, Spain | |
| dc.description | D'Agostino, M., (2013) Analytic Inference and the Informational Meaning of the Logical Operators, , Logique et Analyse, in print | |
| dc.description | Dunn, J.M., Intuitive semantics for first-degree entailments and coupled trees (1976) Philosophical Studies, 29, pp. 149-169 | |
| dc.description | Matulovic, M., (2013) Proofs in the Algibeira: Polynomials As A Universal Method of Proof, , Ph.D. Thesis State University of Campinas (UNICAMP) Brazil | |
| dc.description | Quine, W.V.O., (1973) The Roots of Reference, , Open Court | |
| dc.language | en | |
| dc.publisher | Elsevier | |
| dc.relation | Electronic Notes in Theoretical Computer Science | |
| dc.rights | fechado | |
| dc.source | Scopus | |
| dc.title | Non-deterministic Semantics In Polynomial Format | |
| dc.type | Artículos de revistas | |
