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.

Version: v2 · 2026-09-19 · History
Domain-specific #: 1841
Domain group: Formal Sciences
Origin domain: Mathematics
Aliases: Finitely many-valued logic

Core Idea¶

A finite-valued logic is a logic whose consequence relation is characterized by a finite semantic value structure, canonically a finite logical matrix. For a propositional language, a deterministic matrix can be written

\[ \mathcal M=\langle V,D,\{f_c:c\in C\}\rangle, \]

where \(V\) is a finite nonempty set of semantic values, \(D\subseteq V\) is the set of designated values, and each connective \(c\) is interpreted by a truth function \(f_c:V^n\to V\) of the connective’s arity. A valuation assigns values to atomic formulas and extends compositionally through the truth functions. Premises \(\Gamma\) entail \(\varphi\) when every valuation that designates every member of \(\Gamma\) also designates \(\varphi\). The logical-matrix and designation framework is the standard semantic core of many-valued logic.

How would you explain it like I'm…

The Sticker Logic Game

Usually we sort sentences into just 'true' or 'false.' Some logics use a small, fixed box of labels instead, maybe three or four. Each label is either a 'good' one or not. Rules tell you which label a combined sentence gets. An argument works if every time the starting sentences get good labels, the ending sentence gets a good label too.

Logic with a Few Values

In ordinary logic every statement is true or false. A Finite-Valued Logic allows a limited list of values, like true, false and 'unknown.' Some of those values are marked as the 'accepted' ones. Words like 'and' and 'not' come with a table that says which value you get from which inputs. A conclusion follows from some starting statements if, whenever all the starting statements have accepted values, the conclusion does too. The values don't have to mean kinds of truth; they could stand for things like 'unknown' or 'contradictory.'

Finite Matrix Logic

A Finite-Valued Logic is a logic whose notion of 'follows from' is fixed by a finite table of semantic values, called a logical matrix. The matrix has a finite set of values, a subset of 'designated' (accepted) values, and a truth function for each connective. You assign values to the basic sentences and compute the rest through the truth functions. Premises entail a conclusion if every such assignment that gives all the premises designated values also gives the conclusion a designated value. This generalizes two-valued logic, where the only designated value is 'true.' The values need not be degrees of truth; they can encode information, inconsistency, indeterminacy or circuit states. What makes a logic genuinely finite-valued is that some finite matrix exactly characterizes its consequence relation, not merely that a few labels are convenient.

A deterministic logical matrix for a propositional language is a triple ⟨V, D, {f_c}⟩. Here V is a finite nonempty set of values, D ⊆ V is the set of designated values, and each n-ary connective c gets a truth function f_c: Vⁿ → V. A valuation assigns values to atoms and extends compositionally through these functions. Γ entails φ when every valuation that sends all of Γ into D also sends φ into D. A logic is finite-valued when its consequence relation is characterized by such a finite matrix. This designation framework is the standard semantics of many-valued logic. The values are semantic roles such as truth status, information, inconsistency, indeterminacy or circuit state, not literal substances. Being finite-valued is a substantive property: one asks whether some finite matrix, sometimes a smallest one, characterizes the logic exactly. Having a handy finite labeling of some cases is not enough.

Scope of Application¶

Finite-valued logics formalize indeterminate, inconsistent, partial, multi-state, or graded distinctions when a finite semantic carrier is appropriate. Three-valued systems can distinguish true, false, and undefined; other three-valued systems use both/indeterminate with different designated sets. Four-valued systems can track evidence for truth and falsity independently. Finite chains support tabular reasoning and automated proof search. Multiple-valued switching theory and hardware description can model a bounded set of signal states under defined operations.

Clarity¶

Three distinctions prevent common errors. A semantic value is an element of \(V\). A designated value is one treated as acceptable for consequence. A truth function specifies a connective’s output for every tuple of input values. Two matrices can share \(V\) and all connective tables but define different logics by choosing different designated sets.

Manages Complexity¶

A finite matrix compresses semantic evaluation into finitely enumerable tables. Formula values can be calculated bottom-up, countervaluations can be searched systematically, and candidate axiomatizations can be tested against a bounded semantic base. This makes logical differences inspectable: one can locate a failed classical law in a specific table row or designation choice rather than in an informal philosophical slogan.

Abstract Reasoning¶

Let \(v\) range over homomorphisms from the formula algebra into the matrix algebra. Designation-preserving consequence is

\[ \Gamma\models_{\mathcal M}\varphi \quad\text{iff}\quad \text{for every }v, \bigl[v(\Gamma)\subseteq D\bigr]\Rightarrow v(\varphi)\in D. \]

This separates algebraic evaluation from the inferential threshold. A connective table fixes how values compose; \(D\) fixes which completed evaluations count as supported.

Knowledge Transfer¶

The same audit transfers across philosophical logic, databases, programming-language semantics, hardware reasoning, and automated deduction: identify values, designation, connective operations, valuations, and consequence; then ask whether the matrix is merely a model or actually characterizes the logic. This avoids assuming that “unknown” means the same thing in SQL, partial functions, future contingents, and epistemic reasoning.

Finite tables also support tool transfer. A truth-table enumerator, model checker, or sequent-calculus generator can be parameterized by \(V\), \(D\), and the operations.

Relationships to Other Abstractions¶

Current abstraction Finite-Valued Logic Domain-specific

Parents (1) — outgoing typed relations

Finite-Valued Logic is a kind of Formal System Prime

The broader abstraction is Formal System: a finite-valued logic has a symbolic language and mechanically checkable semantic/proof rules closed under declared operations.

Children (1) — abstractions linked here by typed relations

Four-Valued Logic Domain-specific is a kind of 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.

Hierarchy paths (2) — routes to 2 parentless roots

Finite-Valued Logic → is a kind of Formal System → presupposes Formalization → presupposes Representation → presupposes Abstraction

Show alternative path (1)

Neighborhood in Abstraction Space¶

Finite-Valued Logic sits in a moderately populated region (59^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Logical Semantics & Many-Valued Systems (12 abstractions)

Nearest neighbors

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