Representation of consistent recursive rules

This paper develops the recursive model for connective rules, where a particular solution in the Ordered Weighted Averaging (OWA) context was translated into a more general framework. In this paper, some families of solutions for the key recursive equation are obtained, based upon the general associativity equation as solved by K. Mak. A context for the representation of families of binary connectives is given, allowing the characterization of key families of connective rules.