Nilpotent Minimum Logic

Origin. Esteva and Godo (2001). Fuzzy logic with nilpotent minimum t-norm. Left-continuous but not continuous. Strict negation properties. Foundation for certain fuzzy reasoning.

Models. Truth values [0,1]. T-norm: min with nilpotent twist. Residuum for implication. Negation: 1-x (involutive). Combines Gödel and Łukasiewicz features.

Formalism.

Nilpotent minimum: x ⊙ y = min(x, y) if x + y > 1, else 0

Residuum: x → y = 1 if x ≤ y = max(1-x, y) otherwise

Negation: ¬x = x → 0 = 1 - x (Łukasiewicz-style)

Properties: Left-continuous everywhere, hence an MTL t-norm; discontinuous on the line x + y = 1. Incomparable with Łukasiewicz: NM proves prelinearity with involution but not divisibility, Łukasiewicz the converse. Stronger than Gödel in some aspects.

Axioms: MTL axioms (monoidal t-norm logic) plus: (φ → ψ) ∨ (ψ → φ) (prelinearity) ¬¬φ → φ (involution) Specific nilpotent axiom.

Comparison: Łukasiewicz: continuous, x ⊙ y = max(0, x+y-1) Gödel: min, but no negation involution NM: pointwise between these two t-norms (Łuk ≤ NM ≤ min), with involutive negation — though as logics NM and Łukasiewicz are incomparable.

Symbols.

Symbol	Unicode	Name	Meaning
⊙	U+2299	Circled dot / Strong conjunction	The nilpotent minimum t-norm
⊕	U+2295	Circled plus / Strong disjunction	De Morgan dual of ⊙
→	U+2192	Rightwards arrow / Residuum	1 if x ≤ y, else max(1−x, y)
¬	U+00AC	Not sign	Involutive negation, ¬x = 1 − x
∨	U+2228	Logical or	Lattice join, maximum
∧	U+2227	Logical and	Lattice meet, minimum
≤	U+2264	Less than or equal	Order on truth degrees
φ	U+03C6	Phi	A formula
ψ	U+03C8	Psi	A formula
NM	—	Nilpotent minimum logic	Esteva and Godo's system
MTL	—	Monoidal t-norm logic	The base NM extends
IMTL	—	Involutive MTL	MTL plus ¬¬φ → φ; NM extends it
[0,1]	—	Standard NM-algebra	Unit interval under the nilpotent minimum

Metatheory. Esteva and Godo (2001) introduced NM together with MTL and proved standard completeness: NM is sound and complete for the single algebra on [0,1] given by the nilpotent minimum t-norm and its residuum. Axiomatically NM is IMTL plus the weak nilpotent minimum schema, so it inherits prelinearity and the subdirect representation into chains from MTL and involutive negation from IMTL; what it does not inherit is divisibility, since the nilpotent minimum is left-continuous but discontinuous along the line x + y = 1, and divisibility would force continuity. NM has the finite model property and is decidable. Gispert (2003) classified its axiomatic extensions through the subvarieties of NM-algebras. The strong connectives behave classically at the extremes while the lattice ones do not: since x ⊙ (1 − x) = 0 for every x, both ¬(φ ⊙ ¬φ) and φ ⊕ ¬φ are valid, whereas φ ∨ ¬φ takes value max(x, 1 − x) and so fails. As a logic NM is incomparable with Łukasiewicz — NM has involution without divisibility, Łukasiewicz has both — even though pointwise the nilpotent minimum lies between the Łukasiewicz t-norm and the minimum.

Applies to. Fuzzy reasoning. Approximate reasoning. Knowledge representation. Control systems. Vague predicates.

Limitations. Divisibility fails, so NM is not an extension of BL, and the Mostert–Shields ordinal-sum analysis of the continuous t-norms says nothing about it. The t-norm is discontinuous on x + y = 1: an arbitrarily small decrease in one conjunct's degree can send the conjunction from min(x, y) straight to 0, so the semantics is not robust under perturbation of truth degrees — an awkward property for a logic offered for approximate reasoning. The nilpotence is severe: x ⊙ x = 0 whenever x ≤ ½, so any proposition at most half true has an outright false self-conjunction, contraction fails, and iterated strong conjunction collapses rather than degrading. Excluded middle survives only in the strong form φ ⊕ ¬φ; the lattice form fails. Negation is exactly 1 − x, so the logic cannot distinguish a genuinely indeterminate proposition from one with a precise intermediate degree, and truth-functionality leaves higher-order vagueness untouched. There are no truth constants and no crispness operator.