loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
35th International Symposium on Multiple-Valued Logic (ISMVL'05)
Polynomial Ring Calculus for Many-Valued Logics
University of Calgary, Canada
May 19-May 21
ISBN: 0-7695-2336-6
ASCII Text
x 
 
Walter Carnielli, "Polynomial Ring Calculus for Many-Valued Logics," Multiple-Valued Logic, IEEE International Symposium on, pp. 20-25, 35th International Symposium on Multiple-Valued Logic (ISMVL'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ISMVL.2005.38,
author = {Walter Carnielli},
title = {Polynomial Ring Calculus for Many-Valued Logics},
journal ={Multiple-Valued Logic, IEEE International Symposium on},
volume = {0},
year = {2005},
issn = {0195-623X},
pages = {20-25},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISMVL.2005.38},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Multiple-Valued Logic, IEEE International Symposium on
TI - Polynomial Ring Calculus for Many-Valued Logics
SN - 0195-623X
SP20
EP25
A1 - Walter Carnielli,
PY - 2005
KW - null
VL - 0
JA - Multiple-Valued Logic, IEEE International Symposium on
ER -
 
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.