The paper deals with the monoidal t-norm based logic satisfying a weaker form of the cancellation law. In particular, its logical and algebraic properties like (finite) strong standard completeness or finite embeddability property are studied.
The paper deals with the monoidal t-norm based logic satisfying a weaker form of the cancellation law. In particular, its logical and algebraic properties like (finite) strong standard completeness or finite embeddability property are studied. (en)