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	T-norm	Nilpotent min
→	U+2192	Residuum	Implication
¬	U+00AC	Negation	Strong negation
∨	U+2228	Maximum	Disjunction
∧	U+2227	Minimum	Conjunction

Metatheory. Standard completeness: complete wrt [0,1] NM-algebra. Decidable. Finite model property. An extension of MTL incomparable with Łukasiewicz; it adds involution to the weak-negation setting of Gödel.

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

Limitations. Less studied than Łukasiewicz/Gödel. Discontinuity at boundary. Fewer applications. Specialized use cases.