Title :
Polynomial ring calculus for many-valued logics
Author :
Carnielli, Walter
Author_Institution :
Centre for Logic, Epistemology & the History of Sci., State Univ. of Campinas, Brazil
Abstract :
This paper discusses a new algebraic proof method for general sentential logics, which is particularly apt for finitely-many-valued logics and for PC, based on reducing polynomials over finite fields. The method can also be extended to cover certain non-finitely valued logics and non-truth-functional logics as well, provided they can be characterized by two-valued dyadic semantics. The resulting mechanizable proof method introduced here is of interest for automatic proof theory, and seems also to be appropriate for investigating questions on complexity.
Keywords :
calculus of communicating systems; computational complexity; multivalued logic; theorem proving; algebraic proof method; automatic proof theory; finite field; functional logic; many-valued logic; polynomial ring calculus; sentential logic; two-valued dyadic semantics; Calculus; Computational complexity; Equations; Galois fields; Geometry; History; Logic functions; Machinery; Multivalued logic; Polynomials;
Conference_Titel :
Multiple-Valued Logic, 2005. Proceedings. 35th International Symposium on
Print_ISBN :
0-7695-2336-6
DOI :
10.1109/ISMVL.2005.38
