Three-valued logic

From Wikipedia, the free encyclopedia
  (Redirected from Ternary logic)
Jump to: navigation, search

In logic, a three-valued logic (also trivalent, ternary, trinary logic, or trilean,[citation needed] sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false and some indeterminate third value. This is contrasted with the more commonly known bivalent logics (such as classical sentential or Boolean logic) which provide only for true and false. Conceptual form and basic ideas were initially created by Jan Łukasiewicz and C. I. Lewis. These were then re-formulated by Grigore Moisil in an axiomatic algebraic form, and also extended to n-valued logics in 1945.

Representation of values[edit]

As with bivalent logic, truth values in ternary logic may be represented numerically using various representations of the ternary numeral system. A few of the more common examples are:

  • in Balanced ternary, each digit has one of 3 values: −1, 0, or +1; these values may also be simplified to −, 0, +, respectively.[1]
  • in Redundant binary representation, each digit can have a value of -1, 0, 0, or 1 (the value 0 has two different representations)
  • in Ternary numeral system, each digit is a trit (trinary digit) having a value of: 0, 1, or 2
  • in Skew binary number system, only most-significant non-zero digit has a value 2, and the remaining digits have a value of 0 or 1
  • 1 for true, 2 for false, and 0 for unknown, unknowable/undecidable, irrelevant, or both.[2][not in citation given]
  • 0 for false, 1 for true, and a third non-integer symbol such as # or ½ for the final value, also known as "maybe".[3]

Inside a ternary computer, ternary values are represented by ternary signals.

This article mainly illustrates a system of ternary propositional logic using the truth values {false, unknown, and true}, and extends conventional Boolean connectives to a trivalent context. Ternary predicate logics exist as well;[citation needed] these may have readings of the quantifier different from classical (binary) predicate logic, and may include alternative quantifiers as well.

Logics[edit]

Kleene logic[edit]

Below is a set of truth tables showing the logic operations for Kleene's logic.

A AND B B
True Unknown False
A True True Unknown False
Unknown Unknown Unknown False
False False False False
A OR B B
True Unknown False
A True True True True
Unknown True Unknown Unknown
False True Unknown False
A NOT A
True False
Unknown Unknown
False True

In these truth tables, the UNKNOWN state can be metaphorically thought of as a sealed box containing either an unambiguously TRUE or unambiguously FALSE value. The knowledge of whether any particular UNKNOWN state secretly represents TRUE or FALSE at any moment in time is not available. However, certain logical operations can yield an unambiguous result, even if they involve at least one UNKNOWN operand. For example, since TRUE OR TRUE equals TRUE, and TRUE OR FALSE also equals TRUE, one can infer that TRUE OR UNKNOWN equals TRUE, as well. In this example, since either bivalent state could be underlying the UNKNOWN state, but either state also yields the same result, a definitive TRUE results in all three cases.

If numeric values are assigned to FALSE, UNKNOWN and TRUE such that FALSE is less than UNKNOWN and UNKNOWN is less than TRUE, then A AND B AND C... = MIN(A, B, C ...) and A OR B OR C ... = MAX(A, B, C...).

Material implication for Kleene logic can be defined as:

 A \rightarrow B \ \overset{\underset{\mathrm{def}}{}}{=} \ \mbox{NOT}(A) \ \mbox{OR} \ B , and its truth table is

A B B
True Unknown False
A True True Unknown False
Unknown True Unknown Unknown
False True True True

which differs from that for Łukasiewicz logic (described below).

Kleene logic has no tautologies (valid formulas) because whenever all of the atomic components of a well-formed formula are assigned the value Unknown, the formula itself must also have the value Unknown. (And the only designated truth value for Kleene logic is True.) However, the lack of valid formulas does not mean that it lacks valid arguments and/or inference rules. An argument is semantically valid in Kleene logic if, whenever (for any interpretation/model) all of its premises are True, the conclusion must also be True. (Note that the Logic of Paradox (LP) has the same truth tables as Kleene logic, but it has two designated truth values instead of one; these are: True and Both (the analogue of Unknown), so that LP does have tautologies but it has fewer valid inference rules.)[4]

Łukasiewicz logic[edit]

The Łukasiewicz Ł3 has the same tables for AND, OR, and NOT as the Kleene logic given above, but differs in its definition of implication. This section follows the presentation from Malinowski's chapter of the Handbook of the History of Logic, vol 8.[5]

A B B
True Unknown False
A True True Unknown False
Unknown True True Unknown
False True True True

In fact, using Łukasiewicz's implication and negation, the other usual connectives may be derived as:

  • AB = (AB) → B
  • AB = ¬(¬A ∨ ¬ B)
  • AB = (AB) ∧ (BA)

It's also possible to derive a few other useful unary operators (first derived by Tarski in 1921):

  • MA = ¬AA
  • LA = ¬M¬A
  • IA = MA ∧ ¬LA

They have the following truth tables:

A MA
False False
Unknown True
True True
A LA
False False
Unknown False
True True
A IA
False False
Unknown True
True False

M is read as "it is not false that..." or in the (unsuccessful) Tarski–Łukasiewicz attempt to axiomatize modal logic using a three-valued logic, "it is possible that..." L is read "it is true that..." or "it is necessary that..." Finally I is read "it is unknown that..." or "it is contingent that..."

In Łukasiewicz's Ł3 the designated value is True, meaning that only a proposition having this value everywhere is considered a tautology. For example AA and AA are tautologies in Ł3 and also in classical logic. Not all tautologies of classical logic lift to Ł3 "as is". For example, the law of excluded middle, A ∨ ¬A, and the law of non-contradiction, ¬(A ∧ ¬A) are not tautologies in Ł3. However, using the operator I defined above, it is possible to state tautologies that are their analogues:

  • AIA ∨ ¬A [law of excluded fourth]
  • ¬(A ∧ ¬IA ∧ ¬A) [extended contradiction principle].

Application in SQL[edit]

The database structural query language SQL implements ternary logic as a means of handling comparisons with NULL field content. The original intent of NULL in SQL was to represent missing data in a database, i.e. the assumption that an actual value exists, but that the value is not currently recorded in the database. SQL uses a common fragment of the Kleene K3 logic, restricted to AND, OR, and NOT tables. Notice that basing SQL on Łukasiewicz L3 logic would conduct to different results as {A AND B} and {A OR B} differ when A and B are both UNKNOWN: Łukasiewicz finds FALSE and TRUE respectively while Kleene finds UNKNOWN.[6] In SQL, the intermediate value is intended to be interpreted as UNKNOWN. Explicit comparisons with NULL, including that of another NULL yields UNKNOWN. However this choice of semantics is abandoned for some set operations, e.g. UNION or INTERSECT, where NULLs are treated as equal with each other. Critics assert that this inconsistency deprives SQL of intuitive semantics in its treatment of NULLs.[7] The SQL standard defines an optional feature called F571, which adds some unary operators, among which IS UNKNOWN corresponding to the Łukasiewicz I in this article. The addition of IS UNKNOWN to the other operators of SQL's three-valued logic makes the SQL three-valued logic functionally complete,[8] meaning its logical operators can express (in combination) any conceivable three-valued logical function.

See also[edit]

References[edit]

  1. ^ Knuth, Donald E. (1981). The Art of Computer Programming Vol. 2. Reading, Mass.: Addison-Wesley Publishing Company. p. 190. 
  2. ^ Hayes, Brian (November–December 2001). "Third Base". American Scientist (Sigma Xi, the Scientific Research Society) 89 (6): 490–494. doi:10.1511/2001.6.490. 
  3. ^ The Penguin Dictionary of Mathematics. 2nd Edition. London, England: Penguin Books. 1998. p. 417. 
  4. ^ http://www.uky.edu/~look/Phi520-Lecture7.pdf
  5. ^ Grzegorz Malinowski, "Many-valued Logic and its Philosophy" in Dov M. Gabbay, John Woods (eds.) Handbook of the History of Logic Volume 8. The Many Valued and Nonmonotonic Turn in Logic, Elsevier, 2009
  6. ^ Hans-Joachim, K. (2003). "Null Values in Relational Databases and Sure Information Answers". Semantics in Databases. Second International Workshop Dagstuhl Castle, Germany, January 7–12, 2001. Revised Papers. Lecture Notes in Computer Science 2582. pp. 119–138. doi:10.1007/3-540-36596-6_7. ISBN 978-3-540-00957-3.  edit
  7. ^ Ron van der Meyden, "Logical approaches to incomplete information: a survey" in Chomicki, Jan; Saake, Gunter (Eds.) Logics for Databases and Information Systems, Kluwer Academic Publishers ISBN 978-0-7923-8129-7, p. 344; PS preprint (note: page numbering differs in preprint from the published version)
  8. ^ C. J. Date, Relational database writings, 1991-1994, Addison-Wesley, 1995, p. 371
  9. ^ "El idioma de los aymaras" (in Spanish). Aymara Uta. Retrieved 2013-08-20. 

Further reading[edit]

External links[edit]

  • Introduction to Many-Valued Logics by Bertram Fronhöfer. Handout from a Technische Universität Dresden 2011 summer class. (Despite the title, this is almost entirely about three-valued logics.)