The Community for Technology Leaders
RSS Icon
Subscribe
Los Angeles, CA
March 31, 2009 to April 2, 2009
ISBN: 978-0-7695-3507-4
pp: 651-654
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.
CITATION
Li-Feng Li, "Consistency of Finite Theory in Three Types of Many-Valued Propositional Logic Systems", CSIE, 2009, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009, pp. 651-654, doi:10.1109/CSIE.2009.77
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool