TOPICS
Search

Multiple-Valued Logic


Multiple-valued logic is a propositional logic having more than the two classical truth values true and false. A finite-valued logic chooses a set V of truth values with |V|>2, interprets each k-ary connective as a function V^k->V, and specifies which values are designated as logically acceptable.

For example, the n-valued Łukasiewicz logic uses V={0,1/(n-1),...,1} and operations

¬x=1-x
(1)
x=>y=min(1,1-x+y).
(2)

Different choices of truth values, connectives, and designated values produce different multiple-valued logics. Infinite-valued systems are also possible. Fuzzy logic commonly uses the full interval [0,1], although its interpretation and applications are not identical to those of every multiple-valued logic.

Łukasiewicz (1920) introduced a three-valued logic, and Post (1921) developed a general theory of finite-valued propositional systems.


See also

Connective, Function, Fuzzy Logic, Interval, Łukasiewicz Logic, Propositional Calculus, Set, Symbolic Logic, Truth Table

Explore with Wolfram|Alpha

References

Łukasiewicz, J. "O logice trójwartościowej." Ruch Filozoficzny 5, 170-171, 1920.Post, E. L. "Introduction to a General Theory of Elementary Propositions." Amer. J. Math. 43, 163-185, 1921.

Cite this as:

Weisstein, Eric W. "Multiple-Valued Logic." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Multiple-ValuedLogic.html

Subject classifications