Monoidal T-norm Logic

Origin. Esteva and Godo (2001). Logic of left-continuous t-norms. Weaker than BL (basic logic). Subsumed by Łukasiewicz, Gödel, Product. Foundation for fuzzy logic hierarchy.

Models. T-norm: [0,1]² → [0,1] associative, commutative, monotone, 1 identity. Left-continuous: residuated. Not necessarily continuous (unlike BL).

Formalism.

T-norm properties: Associativity: x * (y * z) = (x * y) * z Commutativity: x * y = y * x Monotonicity: x ≤ y implies x * z ≤ y * z Identity: x * 1 = x

Residuum: x * y ≤ z iff y ≤ x → z Left-continuous t-norm has residuum.

MTL axioms: (φ → ψ) → ((ψ → χ) → (φ → χ)) φ ∧ ψ → φ φ ∧ ψ → ψ ∧ φ φ ⊙ (φ → ψ) → φ ∧ ψ (φ → (ψ → χ)) → (φ ⊙ ψ → χ) ((φ → ψ) → χ) → (((ψ → φ) → χ) → χ) — prelinearity

Prelinearity: (φ → ψ) ∨ (ψ → φ) Chains: linearly ordered models.

Hierarchy: MTL ⊂ BL ⊂ Łukasiewicz MTL ⊂ IMTL (with involutive negation) MTL ⊂ SMTL (Strict MTL: MTL + (φ ∧ ¬φ) → ψ, whose algebras are pseudocomplemented)

Symbols.

Symbol	Unicode	Name	Meaning
⊙	U+2299	Circled dot / Strong conjunction	The t-norm, as a connective
→	U+2192	Rightwards arrow / Residuum	Implication, residuated to ⊙
*	U+002A	Asterisk	The t-norm, as an operation on [0,1]
∧	U+2227	Logical and	Lattice meet, the weak conjunction
∨	U+2228	Logical or	Lattice join, the weak disjunction
¬	U+00AC	Not sign	Defined negation, φ → 0
≤	U+2264	Less than or equal	Order on truth degrees
⊂	U+2282	Subset of	Proper inclusion of logics in the hierarchy
φ	U+03C6	Phi	A formula
ψ	U+03C8	Psi	A formula
χ	U+03C7	Chi	A formula
MTL	—	Monoidal t-norm logic	Esteva and Godo's system
IMTL	—	Involutive MTL	MTL plus ¬¬φ → φ
SMTL	—	Strict MTL	MTL plus (φ ∧ ¬φ) → ψ
BL	—	Basic Logic	MTL plus divisibility

Metatheory. Esteva and Godo (2001) introduced MTL as the logic of left-continuous t-norms and conjectured standard completeness; Jenei and Montagna (2002) proved it, showing MTL sound and complete for the algebras on [0,1] determined by left-continuous t-norms and their residua. Algebraically, MTL-algebras are exactly the prelinear bounded commutative integral residuated lattices — equivalently the algebras of FLew plus prelinearity — and prelinearity yields the subdirect representation: every subdirectly irreducible MTL-algebra is a chain, so every MTL-algebra is a subdirect product of chains. That is what makes standard completeness reachable at all, since it reduces the problem to linearly ordered algebras. MTL has the finite model property and is decidable, and is finitely strongly complete. Left-continuity is precisely the condition for a t-norm to have a residuum, so MTL is the weakest logic in this family with a well-defined implication; adding divisibility strengthens left-continuity to continuity and gives Hájek's BL, and the involutive, strict, and nilpotent-minimum extensions are each standard-complete for their own subclasses.

Applies to. Fuzzy logic foundation. Approximate reasoning. Control systems. Vague predicates. T-norm classification.

Limitations. Without divisibility the identity φ ∧ ψ ↔ φ ⊙ (φ → ψ) fails, so weak conjunction is an irreducible primitive rather than something the residuum defines, and MTL therefore has two conjunctions that must be tracked separately. Negation is defined as φ → 0 and is not involutive, so ¬¬φ → φ fails and excluded middle fails in the lattice form. Strong conjunction is not idempotent, so contraction fails and the deduction theorem is available only locally. Prelinearity is not optional: drop it and the subdirect chain representation goes, and with it the whole standard-completeness argument. The logic underdetermines its semantics — completeness is with respect to the entire class of left-continuous t-norms, and the familiar individual ones — minimum, Łukasiewicz, product, nilpotent minimum — each validate strictly more, so no single intended model is picked out. There are no truth constants and no crispness operator, so degrees cannot be named and full truth cannot be asserted inside the language.