Basic Fuzzy Logic

Origin. Hájek (1998). The logic of all continuous t-norms, complete for BL-algebras. It unifies Łukasiewicz, Gödel, and Product logic as axiomatic extensions and founds mathematical fuzzy logic.

Models. Continuous t-norms on [0,1] with their residua. BL-algebras: prelinear, divisible, bounded commutative integral residuated lattices. Standard completeness: BL is complete for the real unit interval under any continuous t-norm.

Formalism.

BL-algebra: ⟨L, ∧, ∨, *, →, 0, 1⟩ with ⟨L, ∧, ∨, 0, 1⟩ a bounded lattice,

• a commutative monoid (t-norm), → its residuum: x * y ≤ z iff x ≤ y → z.

Axioms (A1–A7): (A1) (φ → ψ) → ((ψ → χ) → (φ → χ)) (A2) φ * ψ → φ (A3) φ * ψ → ψ * φ (A4) φ * (φ → ψ) → ψ * (ψ → φ) [divisibility] (A5a) (φ → (ψ → χ)) → (φ * ψ → χ) (A5b) (φ * ψ → χ) → (φ → (ψ → χ)) (A6) ((φ → ψ) → χ) → (((ψ → φ) → χ) → χ) [prelinearity] (A7) 0 → φ

Divisibility (BL = MTL + divisibility): x ∧ y = x * (x → y). Dropping it gives MTL (left-continuous t-norms); adding it forces continuity.

Mostert–Shields: Every continuous t-norm is an ordinal sum of three: Łukasiewicz xy = max(0, x+y−1), Gödel xy = min(x,y), Product x*y = x·y.

Prelinearity: (φ → ψ) ∨ (ψ → φ). Every subdirectly irreducible BL-algebra is a BL-chain; the converse fails. Hence every BL-algebra is a subdirect product of chains.

Negation: ¬φ := φ → 0. Defined, not generally involutive.

Principal extensions: BL + involution = Łukasiewicz (MV). BL + idempotence (x*x = x) = Gödel. BL + cancellativity = Product.

Standard completeness: Every finite partial subalgebra of a BL-chain embeds into a [0,1] t-norm algebra — full embedding fails, partial embeddability suffices (Cignoli, Esteva, Godo, Torrens 2000); BL is complete for [0,1], with finite strong completeness and decidability.

Symbols.

Metatheory. Hájek (1998) proved BL sound and complete with respect to the variety of BL-algebras, and conjectured the sharper result that BL is exactly the logic of the continuous t-norms on [0,1]; Cignoli, Esteva, Godo, and Torrens (2000) proved it. Their argument turns on partial embeddability rather than embeddability: no BL-chain need embed into a standard algebra, but every finite partial subalgebra of one does, and finite partial embeddability is all a finitary completeness proof needs. Prelinearity gives the subdirect representation — every subdirectly irreducible BL-algebra is a chain, so every BL-algebra is a subdirect product of chains — and divisibility is exactly what separates BL from MTL, forcing continuity of the t-norm rather than mere left-continuity. Mostert and Shields (1957) show every continuous t-norm is an ordinal sum of the Łukasiewicz, Gödel, and product t-norms, which is why those three are the principal schematic extensions: adding involution gives Łukasiewicz, idempotence gives Gödel, cancellativity gives Product. Propositional BL is decidable and finitely strongly complete.

Applies to. Mathematical fuzzy logic. Approximate reasoning. Vagueness as degree. T-norm theory. Continuous-valued inference.

Limitations. Divisibility forces continuity, so the left-continuous but discontinuous t-norms — nilpotent minimum among them — are not models of BL and require MTL instead. Negation is defined as φ → 0 and is not involutive: ¬¬φ → φ fails, as does excluded middle in the lattice form φ ∨ ¬φ. Strong conjunction is not idempotent, so contraction fails and the deduction theorem holds only locally, relative to some power φⁿ. Standard completeness is finitely strong only; it does not extend to consequence from infinite theories. BL has no truth constants for intermediate degrees, so a degree cannot be named inside the language — Rational Pavelka logic adds them — and no Baaz Δ, so "φ is fully true" is not expressible without an extension. The first-order extension BL∀ is complete for linearly ordered BL-algebras, but the standard-model validities of its Łukasiewicz extension are not recursively enumerable, so no recursive axiomatization of first-order t-norm validity is available in that case.

© 2026 Lingenic LLC