Computer Science and Information Engineering, World Congress on (2009)

Los Angeles, California USA

Mar. 31, 2009 to Apr. 2, 2009

ISBN: 978-0-7695-3507-4

pp: 651-654

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.77

ABSTRACT

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.

INDEX TERMS

CITATION

Li-Feng Li,
"Consistency of Finite Theory in Three Types of Many-Valued Propositional Logic Systems",

*Computer Science and Information Engineering, World Congress on*, vol. 04, no. , pp. 651-654, 2009, doi:10.1109/CSIE.2009.77CITATIONS

SEARCH