This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Consistency of Finite Theory in Three Types of Many-Valued Propositional Logic Systems
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
In many-valued propositional logic systems, Let $\Gamma$ be a finite theory, there is a question that if $\Gamma$ is a consistency theory in $ n_{1}$-valued logic, is it consistent in $n_{2}$-valued logic? In this paper, we answer this question in following three prominent many-valued propositional logic systems.i.e. \L ukasiewicz many-valued propositional logic systems $L_{n}$, G\"{o}del many-valued propositional logic systems $G_{n}$, and the $R_{0}$-type many-valued propositional logic systems(NM logic) $\mathcal{L}^{*}_{n}$. The result shows that in different logic systems the conclusion is different.
Citation:
Li-Feng Li, "Consistency of Finite Theory in Three Types of Many-Valued Propositional Logic Systems," csie, vol. 4, pp.651-654, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.