Four-Valued Logic¶

A finite-valued logical system whose semantics distinguishes exactly four values, with the meaning and connective tables fixed by a declared logic rather than by cardinality alone.

Version: v1 · 2026-09-28 · History
Domain-specific #: 7649
Domain group: Humanities
Origin domain: Philosophy
Subdomain: Many Valued Logic → Philosophy
Aliases: Four-valued semantics, 4-valued logic

Core Idea¶

A Four-Valued Logic assigns formulas values from a set of exactly four semantic states and defines connectives, entailment, and designated values over that set.^[1] The number four does not identify a unique logic.^[2] One system may distinguish true, false, both, and neither in order to represent inconsistent and incomplete information; a hardware description system may distinguish 0, 1, unknown, and high impedance for circuit simulation.^[3] The values' meanings and operations are load-bearing.^[4]

Belnap's well-known informational system treats “both” and “neither” as distinct from classical truth and falsity, allowing a database to retain contradiction without making every conclusion derivable. This is not simply classical logic with two error codes: negation, conjunction, disjunction, information ordering, and consequence must be specified for the four-state semantics.^[5]

Structural Signature¶

Sig role-phrases:

Logical carrier — formulas, propositions, or modeled signals are the objects assigned semantic values.
Four-element value set — exactly four distinct states form the codomain of evaluation.
Value interpretation — each state has a declared reading, such as true, false, both, and neither or 0, 1, X, and Z.
Valuation rule — atomic carriers receive one of the four states under the system's semantics.
Closed operations — negation and any other connectives or gates map four-valued inputs back into the same set through explicit tables or algebraic laws.
Consequence structure — designated values, order relations, or another declared rule determines what follows from evaluated premises.
System-specific guarantees — properties such as contradiction tolerance or signal-state propagation arise from the chosen operations and consequence relation, not from fourness alone.
Cardinality boundary — four stored labels without operational participation are not a four-valued logic, and two systems with four values need not share any semantic equivalence.

What It Is Not¶

Not one uniquely determined calculus. Having four values fixes a cardinality, not their meanings, connective tables, designated set, order relations, or consequence rule.
Not automatically Belnap's logic. True, false, both, and neither define one important informational semantics, not every four-valued system.
Not automatically paraconsistent. Four semantic states do not by themselves block explosion; the system's consequence relation must establish that property.
Not ordinary binary logic with two error codes. The additional states must participate in the declared operations and inference rules rather than remain inert implementation metadata.
Not any four-way classification. Four stored labels form a four-valued logic only when formulas or signals are evaluated over them through closed logical operations and a consequence structure.
Not semantically equivalent to four-state hardware logic. Belnap's “both” and “neither” do not mean a circuit simulator's unknown and high-impedance states, even though both systems use four labels.^[6]
Not necessarily truth-functional in the same way. Connective behavior and designatedness must be stated for the particular logic instead of inferred from the number of values.

Scope of Application¶

Four-Valued Logic applies to a declared formal system in which formulas, propositions, modeled signals, or protocol fields take exactly four semantic values and those values participate in explicit operations and consequence or propagation rules.^[7] Every habitat must preserve its own value meanings and tables; four labels, two extra metadata codes, or a mapping based only on cardinality is outside the scope.

Belnap's A4 information semantics. Propositions receive true, false, both, or neither according to the positive and negative information supplied about them.
Contradictory multi-source reasoning. Reports supporting both a proposition and its negation can be retained as a distinct semantic state without treating the conflict as ordinary truth or falsity.
Incomplete-information reasoning. The absence of support for either side is represented as neither, keeping missing information separate from contradiction.
Computer question-answering systems. Belnap's original problem setting uses the four states to answer queries when stored sources can be fallible, mutually inconsistent, or silent.
Paraconsistent consequence systems. A four-valued logic can block explosion when its designated values and entailment relation are explicitly constructed to do so; fourness alone is insufficient.^[8]
Bilattice and ordered semantics. Truth and information orders organize the same four values differently, supporting monotone information growth and separately defined logical connectives.
Four-valued connective calculi. Negation, conjunction, disjunction, implication, and other operations are defined by complete tables or algebraic laws closed over the four-element set.
Two-bit semantic implementations. The four states can be encoded by pairs of bits when the bit mapping preserves their declared information and logical operations rather than serving as storage alone.
Matrix transition systems. Four logical vectors and explicitly defined transition matrices provide a discrete operational representation of four-valued state change.
IEEE 1364 digital-circuit modeling. Hardware-description semantics use 0, 1, X, and Z to distinguish Boolean levels, unknown state, and high impedance under defined signal-propagation rules.
Verilog simulation. Four-state values participate in the language's gate and expression semantics for unresolved, uninitialized, or undriven signals in simulated circuits.
VHDL multi-state logic subsets. A 0/1/X/Z fragment can be studied as a four-valued subsystem only under its own hardware-standard operations, not as Belnap's informational logic.
SAE J1939 field logic. False, true, error condition, and not installed form a protocol-specific four-state system when their distinct combination and disregard rules are retained.
Quaternary hardware proposals. Four-level gates and storage architectures fall within scope only when four signal values participate in defined logical transformations rather than merely encoding two binary bits.
Comparative finite-valued semantics. Formal comparisons among four-valued systems require explicit homomorphisms or value-and-operation mappings, because equal cardinality does not make informational, electrical, and protocol meanings interchangeable.

Clarity¶

A clear account never stops at naming four labels. It declares whether values represent truth status, information state, circuit drive, or another property; distinguishes truth order from information order when both exist; and shows connective tables. “Unknown” can mean no evidence, indeterminate truth, uninitialized simulation, or epistemic uncertainty—these are not interchangeable.

Manages Complexity¶

A four-valued logic compresses a larger spread of information conditions into four explicitly operated states instead of forcing every case into binary truth and falsity. In Belnap's system, an analyst tracks just two evidential coordinates—support for a proposition and support against it—whose combinations yield true, false, both, and neither. Connective tables, the truth and information orders, and the designated values then make contradiction, absence of information, and ordinary affirmation or denial produce distinct inferential branches without tracing every source report separately.

The same four-slot economy can serve a different problem in hardware simulation, where 0, 1, unknown, and high impedance let gate tables propagate unresolved and undriven signals without modeling every circuit-level cause. The compression stops at the declared semantics. Cardinality alone does not transfer Belnap's inferences to IEEE signal values, “both” cannot be substituted for X or Z, and each connective or gate must define all mixed cases; if two of the four labels are merely stored metadata rather than inputs to the operations and consequence relation, the supposed four-valued logic has not performed this compression.

Abstract Reasoning¶

Reasoning evaluates formulas under the declared algebra and then tests preservation of designated status. In an information-oriented system, accumulating a conflicting report can move a value from true to both without licensing arbitrary conclusions. In a circuit system, an unknown input can propagate differently from a high-impedance connection.

Comparisons should use homomorphisms or explicit value mappings; equal cardinality does not establish semantic equivalence.

Knowledge Transfer¶

Within logic and formal semantics, results transfer literally among notations, implementations, proof systems, or data representations only when an explicit mapping preserves the four values, their meanings, connective operations, designated set, and consequence relation. What carries in Belnap-style work is the separation of support, opposition, both, and neither together with the truth and information orders; what carries in four-state hardware work is the distinct propagation of 0, 1, unknown, and high impedance through declared gate tables. The shared vocabulary of valuation, connective, designated value, order, homomorphism, and entailment licenses diagnostics for conflating absence with contradiction, treating stored metadata as a semantic value, or assuming equal labels imply equal logics. An analyst can intervene by writing the full operation tables, testing the proposed value map, or weakening a theorem to the algebraic structure actually preserved.

Beyond a particular four-valued system, the honest reach is B — shared abstract mechanism through Finite-Valued Logic, with A — analogy for informal four-way classifications. General results about finite semantic algebras, homomorphisms, or matrix consequence can transfer when their hypotheses hold, but Belnap's inference rules do not thereby transfer to a circuit simulator, and hardware propagation does not determine informational entailment. The exact four values, their intended interpretation, lattice orders, truth tables, and standards remain home-bound to the declared logic. A four-quadrant taxonomy is only analogous unless its labels participate in closed logical operations and consequence. Transfer stops before cardinality alone is treated as semantic equivalence or before the word “unknown” is assumed to mean the same state across epistemic, database, and electrical settings.

Examples¶

Canonical¶

A question-answering store receives evidence for proposition P from one source and evidence for ¬P from another. Belnap's semantics assigns P the value “both,” distinct from “true,” “false,” and “neither.” Negation leaves “both” as “both,” and the declared connectives and designated values determine which conclusions follow.^[9] The contradiction is retained without automatically licensing every unrelated proposition. If neither positive nor negative evidence were present, the value would instead be “neither,” keeping inconsistency separate from absence of information.

Mapped back: Proposition P is the Logical carrier, and true, false, both, and neither make the Four-element value set with the declared Value interpretation. Source reports feed the Valuation rule; negation and the other tables provide Closed operations. Designated values or orders supply the Consequence structure, and contradiction tolerance is among the System-specific guarantees of this specific semantics.

Applied / In Practice¶

In a Verilog circuit simulation, one modeled wire has value Z because it is undriven, while another has value X because the simulator cannot determine whether it is 0 or 1. Gate and expression tables propagate these values according to hardware semantics. They are not Belnap's “neither” and “both”: Z describes high impedance and X unknown signal state, not missing versus conflicting testimony.^[10] Replacing them with two unused metadata labels would also fail, because the states must participate in the simulator's operations.

Mapped back: Simulated wires are the Logical carrier, and 0, 1, X, and Z instantiate the Four-element value set under a hardware-specific Value interpretation. Signal initialization and drive conditions supply the Valuation rule, while gate tables are Closed operations that yield the relevant System-specific guarantees. Distinguishing this system from Belnap's despite equal cardinality enforces the Cardinality boundary.

Structural Tensions¶

T1: Expressive distinction versus rule complexity. Four values can keep truth, falsity, conflict, and absence—or distinct signal conditions—apart, but every added distinction enlarges connective tables, proof obligations, and implementation cases.
Diagnostic: Does each of the four states change an operation or consequence that the application genuinely needs?

T2: Contradiction tolerance versus classical inference strength. A suitable four-valued consequence relation can retain inconsistent information without explosion, although doing so may invalidate familiar classical steps that users expect.
Diagnostic: Which classical inferences survive under the declared designated values and entailment relation, and which are intentionally withheld?

T3: Missing information versus conflicting information. Separating “neither” from “both” prevents silence and disagreement from receiving the same treatment, yet evidence provenance must be good enough to tell those conditions apart.
Diagnostic: What positive and negative support moves the carrier into each state, and can the system distinguish no report from opposed reports?

T4: Shared cardinality versus semantic interoperability. Two systems can each expose four labels while assigning them different meanings, orders, operations, and designated sets. Cardinality makes comparison tempting but does not supply a semantics-preserving translation.
Diagnostic: Does the proposed mapping preserve the values' interpretations, connective operations, and consequence relation rather than only pair four names?

T5: General algebra versus domain interpretation. Abstract four-element operations enable reusable theorems, while informational, electrical, and protocol readings impose distinct empirical or operational meanings on the same-sized carrier.
Diagnostic: Which conclusion follows from the algebra alone, and which additionally depends on the chosen domain interpretation?

T6: Compact encoding versus logical identity. Two bits can store four states efficiently, but a physical or software encoding does not become a four-valued logic unless operations and consequence are defined over the represented values.
Diagnostic: If the bit layout changed while the semantic tables were preserved, would the same logic remain—and if the tables disappeared, would anything beyond storage remain?

T7: Four-Valued Logic autonomy versus reduction to Finite-Valued Logic (Finite-Valued Logic). The immediate domain-specific parent abstraction carries the broader family of logical systems with a finite semantic codomain. Every Four-Valued Logic is a strict kind of Finite-Valued Logic, with exact cardinality four as its specialization: removing the four-element boundary leaves the parent, while keeping four labels without their system-specific meanings and operations leaves no adequate instance of the child.
Diagnostic: Does the account treat fourness as a constitutive specialization of Finite-Valued Logic without pretending that all four-valued systems share one calculus?

Structural–Framed Character¶

Four-Valued Logic is mixed-structural. Its vocab_travels is low because truth values, designated sets, connective tables, consequence, and logical matrices are formal-semantics terms. Its evaluative_weight is low because validity follows from stipulated operations rather than desirability. Its institutional_origin lies in deliberately specified logical systems. Its human_practice_bound is moderate because the semantics is conventional, although consequences are mechanically fixed once chosen. On import_vs_recognize, exactly four values and their interpretation are imported; valid evaluations are then recognized.

The exact immediate parent, Finite-Valued Logic, is the in-domain umbrella: Four-Valued Logic is its strict cardinality-four subtype. The thinnest portable skeleton is a compositional formal semantics over a finite value carrier with designated outcomes and closed operations. No current catalog Prime owns this skeleton. Portable and cross-domain reach belongs to that uncataloged thin skeleton. Specific Belnap-style and hardware-style meanings remain distinct branches rather than interchangeable instances.

Its character: mixed-structural because finite compositional tables are exact, while the value meanings, connectives, designation, and consequence relation are stipulated frames.

Structural Core vs. Domain Accent¶

Four-Valued Logic is domain-specific rather than a prime because it fixes a logical matrix to exactly four semantic values while retaining system-specific operations, designation, and consequence.

What is skeletal (could lift toward a cross-domain prime). The immediate in-domain umbrella is Finite-Valued Logic: a formal language is evaluated in a finite logical matrix with a finite value carrier, designated subset, total connective operations, compositional valuations, and a declared consequence relation. Four-Valued Logic is a strict domain-specific specialization rather than a prime because it fixes that semantic carrier to exactly four elements while leaving their meanings, operations, designation, and inferential guarantees system-specific. No current catalog prime owns this complete finite-matrix skeleton.

What is domain-bound. Logical carrier is evaluated into a Four-element value set under a declared Value interpretation and Valuation rule; Closed operations keep connective or gate outputs within the set, while Consequence structure determines designated outcomes or propagation. System-specific guarantees may include contradiction tolerance or hardware-state behavior, and the Cardinality boundary rejects four stored labels that do not participate in those operations. Belnap's true/false/both/neither, Verilog's 0/1/X/Z, lattice orders, truth tables, designation, and protocol meanings are distinct formal accents rather than interchangeable names for one calculus.

Why this does not clear the prime bar. The complete named signature does not recur literally across at least three unrelated domains: a four-quadrant policy taxonomy, four-stage clinical classification, and four-color design palette have four labels but no compositional valuation, closed logical operations, or consequence relation. Knowledge Transfer accordingly routes shared results through Finite-Valued Logic and permits literal transfer only when the entire finite-matrix interface survives; equal cardinality alone is analogy. Removing exact cardinality four while retaining a finite value carrier, designated set, connective operations, valuations, and consequence leaves Finite-Valued Logic, not Four-Valued Logic; removing that logical-matrix machinery while retaining four labels leaves a classification or encoding and destroys the strict subsumption under Finite-Valued Logic.

This entry is a kind of Finite-Valued Logic.

Immediate domain parent — Finite-Valued Logic (Finite-Valued Logic). The formal language and formulas provide the carrier; an exactly four-element semantic set supplies the finite value codomain; the designated subset, closed connective tables or algebraic laws, compositional valuation, and declared consequence rule supply the parent logical matrix. Four-Valued Logic adds the strict cardinality constraint without fixing one interpretation: Belnap-style true/false/both/neither and hardware-style 0/1/X/Z remain different children of the same four-state family. Removing exact fourness leaves a Finite-Valued Logic, while removing the finite semantic matrix and consequence structure leaves only four labels rather than a logic.

Related to — Formal System (Formal System). The relationship is inherited through Finite-Valued Logic: symbolic formulas, formation rules, and mechanically checkable operations give the logic a formal artifact. It is not asserted as a separate direct parent because a semantic characterization by a finite logical matrix does not by itself guarantee the Prime's complete axiom-set, proof-rule, and derivation-closure package; those commitments must be established for the particular proof presentation.

Relationships to Other Abstractions¶

Current abstraction Four-Valued Logic Domain-specific

Parents (1) — more general patterns this builds on

Four-Valued Logic is a kind of Finite-Valued Logic Domain-specific

The formal language and formulas provide the carrier; an exactly four-element semantic set supplies the finite value codomain; the designated subset, closed connective tables or algebraic laws, compositional valuation, and declared consequence rule supply the parent logical matrix.

Hierarchy paths (2) — routes to 2 parentless roots

Four-Valued Logic → Finite-Valued Logic → Formal System → Formalization → Representation → Abstraction

Show alternative path (1)

Neighborhood in Abstraction Space¶

Four-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 — Logical Semantics & Many-Valued Systems (11 abstractions)

Nearest neighbors

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

Not to Be Confused With¶

Belnap's Four-Valued Logic. Belnap's system is one important four-valued logic interpreting values as true, false, both, and neither with particular truth and information orderings. Tell: those four meanings and the associated connectives identify Belnap's member, while other four-valued truth tables remain different logics.
IEEE 0/1/X/Z Logic. IEEE-style 0, 1, X, and Z values model digital signals, uncertainty, and high impedance under engineering resolution rules. Tell: electrical drive and simulation semantics identify the signal logic; truth-status semantics identify a philosophical or formal four-valued logic.
Fuzzy Logic. Fuzzy logic ordinarily permits graded truth across a continuum or larger scale rather than exactly four discrete semantic states. Tell: arbitrary intermediate degrees identify fuzzy logic; closure on four declared values identifies a four-valued system.
Four-Valued Database Field. A database field with four codes is a data encoding and need not define negation, conjunction, entailment, or consequence. Tell: four stored labels alone form a code; truth-functional operations and an inference relation are required for a logic.
Paraconsistent Logic. Paraconsistent logic is the broader family that blocks explosion from contradiction and may use two, three, four, or more values. Tell: nonexplosive consequence establishes paraconsistency; exactly four truth values is an additional design choice, not the family definition.

References¶

[1] A Useful Four-Valued Logic registry ↩ Show verification details

[2] Unverified encyclopedia synthesis; claim-specific authoritative support was not established in this verification pass. ↩

[3] Unverified encyclopedia synthesis; claim-specific authoritative support was not established in this verification pass. ↩

[4] Unverified encyclopedia synthesis; claim-specific authoritative support was not established in this verification pass. ↩

[5] Unverified encyclopedia synthesis; claim-specific authoritative support was not established in this verification pass. ↩

[6] Unverified encyclopedia synthesis; claim-specific authoritative support was not established in this verification pass. ↩

[7] Unverified encyclopedia synthesis; claim-specific authoritative support was not established in this verification pass. ↩

[8] Unverified encyclopedia synthesis; claim-specific authoritative support was not established in this verification pass. ↩

[9] Unverified encyclopedia synthesis; claim-specific authoritative support was not established in this verification pass. ↩

[10] Unverified encyclopedia synthesis; claim-specific authoritative support was not established in this verification pass. ↩