Many-valuedSimilarity-TheoryandApplicationsofFuzzy.pptVIP

Many-valued Similarity- Theory and Applications of Fuzzy Reasoning Esko Turunen Tampere University of Technology Finland * All human beings are mortal Sokrates is a human being Motivation Sokrates is mortal Aristotelian logic: It took thousands of years before Aristotelian informal logic was expressed in a formal way, today known as First-order Boolean Logic In 1960’s Zadeh introdused Fuzzy Logic: Red apples are ripe This apple is more or less red This apple is almost ripe More generally (fuzzy rule systems): IF x is in A1 and y is in B1 THEN z is in C1 * * * IF x is in An and y is in Bn THEN z is in Cn What is the mathematical formalism of Zadeh’s Fuzzy Logic? We claim it is Pavelka - Lukasiewicz many-valued logic, in particular, many-valued similarity. Lecture I In science, we always want to minimize the set of axioms and maximize the set of the consequences of these axioms. Thus, consider the following Definition 1. Let L be a non-void set, 1 an element of L and →, * a binary and unary operation, respectively, defined on L such that, for all x, y, z in L, we have: Then the system L = ?L, →,*,1? is called Wajsberg algebra. Now, define on a Wajsberg algebra L a binary relation ≤ by (5) x ≤ y iff x→y = 1. Then, by (2) we have Hence, by (1) we have which implies (6) x→x = 1, i.e. x ≤ x. Let x→y = 1 and y→z = 1, that is, let x ≤ y and y ≤ z. By (2), thus (7) if x ≤ y, y ≤ z then x ≤ z. Let x→y = 1 and y→x = 1, that is, let x ≤ y and y ≤ x. By (3), 1→y = 1→x, thus, x = y. We conclude (8) if x ≤ y, y ≤ x then x = y. Equations (6) – (8) show that (5) defines an order on L. Next we show that the element 1 is the greatest element with respect to this order, in other words (9) for all x in L, x →1 = 1, i.e. x ≤ 1. To this end, we first reason, by (3), (1) and (6), (x→1)→1 = (1→x)→x = x→x = 1, that is (10) (x→1)→1 = 1 On the other hand, by (1), (10), (1) and (2), in other words, Thus, so by (8) First exerc