loading...
Polynomial Ring Calculus for Many-Valued Logics
University of Calgary, Canada May 19-May 21
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISMVL.2005.3835th International Symposium on Multi ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Walter Carnielli, State University of Campinas - UNICAMP, Brazil
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.
Citation:
Walter Carnielli, "Polynomial Ring Calculus for Many-Valued Logics," ismvl, pp.20-25, 35th International Symposium on Multiple-Valued Logic (ISMVL'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.