Implications in bounded systems

A consistent connective system generated by nilpotent operators is not necessarily isomorphic to Łukasiewicz-system. Using more than one generator function, consistent nilpotent connective systems (so-called bounded systems) can be obtained with the advantage of three naturally derived negations and thresholds. In this paper, implications in bounded systems are examined. Both R- and S-implications with respect to the three naturally derived negations of the bounded system are considered. It is shown that these implications never coincide in a bounded system, as the condition of coincidence is equivalent to the coincidence of the negations, which would lead to Łukasiewicz logic. The formulae and the basic properties of four different types of implications are given, two of which fulfill all the basic properties generally required for implications.