On a maximal distance between graphs
The information boundedness principle requires that the knowledge obtained as a result of an inference process should not have more information than that contained in the consequent of the rule. From this point of view relevancy transformation operators as a generalization of implications are investigated.
The notion of reverse of any binary operation on the unit interval is introduced. The properties of reverses of some binary operations are studied and some applications of reverses are indicated.
Page 1