Undefinability of min-conjunction in MTL

  • Authors:
  • San-min Wang;Ming-yan Wang

  • Affiliations:
  • Department of Computer Science and Engineering, Nanchang University, Nanchang 330029, PR China;Department of Computer Science and Engineering, Nanchang University, Nanchang 330029, PR China

  • Venue:
  • Fuzzy Sets and Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.20

Visualization

Abstract

Firstly, a sufficient and necessary condition is given to decide whether the lattice operations of a WNM-chain can be definable from its other operations. Secondly, we show that it is indeed necessary to introduce the min-conjunction into MTL as a primitive connective by constructing a left-continuous t-norm such that in the propositional calculus defined by this t-norm the min-conjunction and max-disjunction are not definable from the strong conjunction, implication and truth constant 0@?.