Consistency of Finite Theory in Three Types of Many-Valued Propositional Logic Systems
Lifeng Li · 2009
In many-valued propositional logic systems, Let Gamma be a finite theory, there is a question that if Gamma is a consistency theory in n1-valued logic, is it consistent in n2-valued logic? In this paper, we answer this question in following three prominent many-valued propositional logic systems .i.e. Lukasiewicz many-valued propositional logic systems Ln, Godel many-valued propositional logic systems Gn, and the R0-type many-valued propositional logic sys- tems(NM logic) Ln*. The result shows that in different logic systems the conclusion is different.