Recursive connective rules

Abstract

An associative binary connective allows the evaluation of arbitrary finite sequences of items by means of a one-by-one sequential process. In this paper we develop an alternative approach for those nonassociative connectives, allowing a sequential definition by means of binary fuzzy connectives. It will be then stressed that a connective rule should be understood as a consistent sequence of binary connective operators.