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

v1 · 2026-08-30 · History

Domain-specific #

1841

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.

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) — more general patterns this builds on

• Finite-Valued Logic is a kind of Formal System Prime

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

Hierarchy paths (2) — routes to 2 parentless roots

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

Show alternative path (1)

Neighborhood in Abstraction Space

Finite-Valued Logic sits in a sparse region of the domain-specific corpus (74^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

• Principle of distributivity — 0.84
• Regular modal logic — 0.84
• Logical equality — 0.83
• Monadic predicate calculus — 0.83
• Conditioned Disjunction — 0.83

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