Three-valued logic¶

A three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false, and some third value.

Version: v1 · 2026-09-28 · History
Domain-specific #: 12541
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Mathematical Logic, Many Valued Logic → Mathematics

Core Idea¶

Three-valued logic is treated here as the recurring cross_domain_models_structures_representations identity summarized by this source-grounded definition: A three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false, and some third value.

A three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false, and some 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. Emil Leon Post is credited with first introducing additional logical truth degrees in his 1921 theory of elementary propositions.

The conceptual form and basic ideas of three-valued logic were initially published by Jan Łukasiewicz and Clarence Irving Lewis. These were then re-formulated by Grigore Constantin Moisil in an axiomatic algebraic form, and also extended to n-valued logics in 1945. Where Kleene logic's only designated truth value is T, Priest logic's designated truth values are both T and U.

For Three-valued logic, the abstraction is narrower than the article's general subject matter: a positive case must preserve A three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false, and some third value. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in cross_domain_models_structures_representations, which is why this identity is domain-specific rather than prime.

Structural Signature¶

Sig role-phrases:

Defining carrier — Similarly, Stephen Cole Kleene used a third value to represent predicates that are "undecidable by [any] algorithms whether true or false".
Constitutive relation — (This may be made clear by considering all possible truth tables for an arbitrary unary operator.
Operating condition — If the truth values 1, 0, and −1 are interpreted as integers, these operations may be expressed with the ordinary operations of arithmetic (where x + y uses addition, xy uses multiplication, and x 2 uses exponentiation), or by the minimum/maximum functions.
Recognition evidence — 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.
Admissible variation — It is also possible to derive a few other useful unary operators (first derived by Tarski in 1921).
Characteristic consequence — It may be defined either by appending one of the two equivalent axioms or equivalently to the axioms of intuitionistic logic, or by explicit truth tables for its operations.
Failure boundary — Some 3VL modular arithmetics have been introduced more recently, motivated by circuit problems rather than philosophical issues.

What It Is Not¶

Not the whole field of cross_domain_models_structures_representations. The node requires the specific identity stated by A three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false, and some third value.
Not an over-broad reading. (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.
Not an over-broad reading. Peirce soundly rejected the idea that all propositions must be either true or false; boundary-propositions, he writes, are "at the limit between P and not P." However, as confident as he was that "Triadic Logic is universally true," he also jotted down that "All this is mighty close to nonsense." Only in 1966, when Max Fisch and Atwell Turquette began publishing what they rediscovered in his unpublished manuscripts, did Peirce's triadic ideas become widely known.
Not an over-broad reading. Bruno de Finetti used a third value to represent when "a given individual does not know the [correct] response, at least at a given moment." Hilary Putnam used it to represent values that cannot physically be decided.
Not automatically Four-valued logic. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Three-valued logic applies literally inside cross_domain_models_structures_representations wherever the source-defined carrier and relation can be established. Its documented habitats include:

Logics. Just as in bivalent logic, where not all operators are given names and subsets of functionally complete operators are used, there may be functionally complete sets of ternary-valued operators.
Motivation. Bruno de Finetti used a third value to represent when "a given individual does not know the [correct] response, at least at a given moment." Hilary Putnam used it to represent values that cannot physically be decided.
Motivation. Similarly, Stephen Cole Kleene used a third value to represent predicates that are "undecidable by [any] algorithms whether true or false".
Kleene and Priest logics. If the truth values 1, 0, and −1 are interpreted as integers, these operations may be expressed with the ordinary operations of arithmetic (where x + y uses addition, xy uses multiplication, and x 2 uses exponentiation), or by the minimum/maximum functions.
Ternary Post logic. Along with minimum and maximum functions to define conjunction and disjunction connectives, respectively.
Ternary Post logic. Unlike the previous system of three-valued logics, Post's 3-valued logic is functionally complete using only the NEG operation and at least one of MIN or MAX operations.

Outside cross_domain_models_structures_representations, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Pattern or should be marked as analogy.

Clarity¶

A clear use of Three-valued logic names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is A three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false, and some third value. The strongest recognition evidence in the frozen account is: 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. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification (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. so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Three-valued logic compresses multiple cross_domain_models_structures_representations details into a stable diagnostic relation. The source shows both the central mechanism—(This may be made clear by considering all possible truth tables for an arbitrary unary operator.—and the practical consequence—it may be defined either by appending one of the two equivalent axioms or equivalently to the axioms of intuitionistic logic, or by explicit truth tables for its operations. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the cross_domain_models_structures_representations entities to which the claim applies.
State the relation. Use the source-grounded identity: A three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false, and some third value.
Check operation and conditions. If the truth values 1, 0, and −1 are interpreted as integers, these operations may be expressed with the ordinary operations of arithmetic (where x + y uses addition, xy uses multiplication, and x 2 uses exponentiation), or by the minimum/maximum functions.
Demand recognition evidence. 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.
Test variation. Change an implementation or setting while preserving it is also possible to derive a few other useful unary operators (first derived by Tarski in 1921).
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Pattern.

Knowledge Transfer¶

Within the home domain. Knowledge about Three-valued logic transfers literally when a new case preserves the same carrier type, relation, and recognition test. Just as in bivalent logic, where not all operators are given names and subsets of functionally complete operators are used, there may be functionally complete sets of ternary-valued operators. Bruno de Finetti used a third value to represent when "a given individual does not know the [correct] response, at least at a given moment." Hilary Putnam used it to represent values that cannot physically be decided.

Beyond the home domain. No canonical parent is asserted for Three-valued logic. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

0 for false, 1 for true, and a third non-integer "maybe" symbol such as ?, #, , or xy. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → A three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false, and some third value; recognition evidence → 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

Applied / In Practice¶

For example, because true OR true equals true, and true OR false also equals true, then true OR unknown equals true as well. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Kleene and Priest logics; invariant → A three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false, and some third value; boundary → the case exits the class when (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

Structural Tensions¶

T1 — Stable identity versus admissible variation. (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. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. Peirce soundly rejected the idea that all propositions must be either true or false; boundary-propositions, he writes, are "at the limit between P and not P." However, as confident as he was that "Triadic Logic is universally true," he also jotted down that "All this is mighty close to nonsense." Only in 1966, when Max Fisch and Atwell Turquette began publishing what they rediscovered in his unpublished manuscripts, did Peirce's triadic ideas become widely known. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. Bruno de Finetti used a third value to represent when "a given individual does not know the [correct] response, at least at a given moment." Hilary Putnam used it to represent values that cannot physically be decided. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. in the redundant binary representation, each digit can have a value of −1, 0, 0/1 (the value 0/1 has two different representations). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. Similarly, Stephen Cole Kleene used a third value to represent predicates that are "undecidable by [any] algorithms whether true or false". The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Three-valued logic literally, co-instantiate Pattern, or only resemble it?

T6 — Autonomy versus reduction. (This may be made clear by considering all possible truth tables for an arbitrary unary operator. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Three-valued logic distinguish that the broader parent Pattern leaves together?

Structural–Framed Character¶

Three-valued logic is mixed or framed-leaning. Its structural side is the repeatable organization summarized by A three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false, and some third value. Its framed side is the cross_domain_models_structures_representations vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: If the truth values 1, 0, and −1 are interpreted as integers, these operations may be expressed with the ordinary operations of arithmetic (where x + y uses addition, xy uses multiplication, and x 2 uses exponentiation), or by the minimum/maximum functions. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Pattern. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. A three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false, and some third value. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: Similarly, Stephen Cole Kleene used a third value to represent predicates that are "undecidable by [any] algorithms whether true or false". (This may be made clear by considering all possible truth tables for an arbitrary unary operator. It further constrains recognition and variation through: If the truth values 1, 0, and −1 are interpreted as integers, these operations may be expressed with the ordinary operations of arithmetic (where x + y uses addition, xy uses multiplication, and x 2 uses exponentiation), or by the minimum/maximum functions. 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.

What is domain-bound. cross domain models structures representations supplies the operative entities, technical vocabulary, warrants, and exceptions that make Three-valued logic literal. Its documented scope includes the condition that Just as in bivalent logic, where not all operators are given names and subsets of functionally complete operators are used, there may be functionally complete sets of ternary-valued operators. Another bounded application condition is that Bruno de Finetti used a third value to represent when "a given individual does not know the [correct] response, at least at a given moment." Hilary Putnam used it to represent values that cannot physically be decided. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—It is also possible to derive a few other useful unary operators (first derived by Tarski in 1921).—and future graph densification may discover a defensible relation only if it preserves that boundary.

This entry is a kind of Formal System.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Three-valued logic. The reviewed identity is: A three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false, and some third value. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Relationships to Other Abstractions¶

Current abstraction Three-valued logic Domain-specific

Parents (1) — more general patterns this builds on

Three-valued logic is a kind of Formal System Prime

A three-valued logic is a formal system specialized by a three-element truth-value semantics; it is not a kind of Omega-logic.

Hierarchy paths (2) — routes to 2 parentless roots

Three-valued logic → Formal System → Formalization → Representation → Abstraction

Show alternative path (1)

Neighborhood in Abstraction Space¶

Three-valued logic sits in a moderately populated region (49^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Formal Logic & Language Constructs (20 abstractions)

Nearest neighbors

Two-Element Boolean Algebra — 0.87
Gödel–Dummett Logic — 0.86
Kripke–Platek set theory with urelements — 0.86
Existential Instantiation — 0.86
Valuation (logic) — 0.86

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Pattern. The parent omits the specialist differentia. Tell: Can the case establish A three-valued logic (also trinary logic, trivalent, ternary, or trilean, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false, and some third value?
Four-valued logic. Four-valued logic names a recurring mathematics and formal science identity with specialized roles and obligations not carried by the frozen neighbors. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Finite-Valued Logic. A logic is characterized by a finite logical matrix: finitely many semantic values, designated values defining consequence, and truth functions interpreting its connectives. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Monoidal t-Norm Logic. The propositional many-valued logic common to all left-continuous t-norms, coupling strong conjunction to residual implication and enforcing prelinearity. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Three-valued logic remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside cross_domain_models_structures_representations lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Pattern?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Three-valued_logic (revision 1370711227).
Preserved source candidate: https://nlp.stanford.edu/nlp/javadoc/javanlp/edu/stanford/nlp/util/Trilean.html
Preserved source candidate: https://web.archive.org/web/20230503011712/https://nlp.stanford.edu/nlp/javadoc/javanlp/edu/stanford/nlp/util/Trilean.html
Preserved source candidate: https://plato.stanford.edu/archIves/sum2020/entries/peirce-logic/three-valued-logic.html
Preserved source candidate: http://www.commens.org/encyclopedia/article/lane-robert-triadic-logic
Preserved source candidate: https://web.archive.org/web/20231206040847/http://commens.org/encyclopedia/article/lane-robert-triadic-logic
Preserved source candidate: https://iiif.lib.harvard.edu/manifests/view/drs:15255301$645i
Preserved source candidate: https://iiif.lib.harvard.edu/manifests/view/drs:15255301$638i
Preserved source candidate: http://www.digitalpeirce.fee.unicamp.br/lane/p-trilan.htm

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.