
Fuzzy Logic 383
(3.124)
These equations are equivalent in [0, 1] to the continuity of , which is satised
only by the Łukasiewicz implication and its isomorphs.
The resulting logic is quite strong and has a lot of interesting properties. As men-
tioned, its syntax is evaluated, which means that evaluated formulas are manipulat-
ed using special inference rules. A formal fuzzy theory T is determined by a triple
where LAx is a fuzzy set of logical axioms, SAx
is a fuzzy set of special axioms and R is a set of inference rules.
The evaluated formal proof of A in T is sequence of evaluated formulas where
each (evaluated) formula is an axiom ...