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
Origin domain: Logic
Subdomain: Many Valued Logic → Logic
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. The number four does not identify a unique logic. 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. The values' meanings and operations are load-bearing.

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. - 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.

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. The compression stops at the declared semantics.

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. 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.

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