Product Logic

Origin. Hájek, Godo, Esteva developed Product Logic (1990s). Many-valued logic with multiplication as conjunction. One of three basic fuzzy logics (with Łukasiewicz, Gödel). Algebraically: product algebras. Part of monoidal t-norm logic family.

Models. Conjunction as multiplication. Łukasiewicz: bounded addition. Gödel: minimum. Product: multiplication on [0,1]. Models probabilistic combination: P(A∧B) = P(A)·P(B) when independent. Different properties from other fuzzy logics.

Formalism.

Truth values: [0,1] real interval.

Connectives:

A ⊗ B = A · B (product conjunction)
A → B = 1 if A ≤ B, else B/A (residuum)
A ∧ B = min(A, B) (lattice meet)
A ∨ B = max(A, B) (lattice join)
¬A = A → 0 = 0 if A > 0, else 1 (Gödel negation)

Key properties:

A ⊗ A ≠ A (not idempotent unless A ∈ {0,1})
Continuity: multiplication is continuous
0 is annihilator: 0 ⊗ A = 0
No proper negation: ¬A = 0 for all A > 0

Product vs Łukasiewicz:

Łuk: A ⊕ B = min(1, A+B), cancellation law fails
Product: A ⊗ B = A·B, cancellation law holds (if A>0)

Axioms: BL (basic fuzzy logic) + ¬¬A → ((A → A⊗B) → B)

Symbols.

Symbol	Unicode	Name	Meaning
⊗	U+2297	Product	Multiplication
→	U+2192	Residuum	Division-based
∧	U+2227	Min	Lattice meet
∨	U+2228	Max	Lattice join
¬	U+00AC	Negation	Gödel-style
0, 1	—	Bounds	False, true

Metatheory. Product logic decidable (coNP-complete). Standard completeness for [0,1] with product t-norm. Algebraically: product algebras = BL-algebras + cancellation. First-order version: decidable. Part of Hájek's BL hierarchy.

Applies to. Probabilistic reasoning (independent events). Fuzzy control (product inference). Uncertainty combination. Decision-making under vagueness. Economic modeling. Signal processing.

Limitations. Zero annihilates: A⊗0=0 loses information. Negation trivial (only 0,1). Less intuitive than Łukasiewicz for some. Specific applications. Part of larger fuzzy logic family.