Some Remarks about L. Atanassova s Paper A New Intuitionistic Fuzzy Implication

Similar documents
A New Intuitionistic Fuzzy Implication

152 K.T. Atanassov Thus one assigns to the proposition p two real numbers (p) and (p) with the following constraint to hold: (p) + (p) 1: Let (p) =1 0

Inclusion of the Intuitionistic Fuzzy Sets Based on Some Weak Intuitionistic Fuzzy Implication

A note on the Hausdorff distance between Atanassov s intuitionistic fuzzy sets

Chebyshev Type Inequalities for Sugeno Integrals with Respect to Intuitionistic Fuzzy Measures

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

On some ways of determining membership and non-membership functions characterizing intuitionistic fuzzy sets

Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.

PROPOSITIONAL CALCULUS

On Intuitionistic Fuzzy Negations and De Morgan Laws

GENERALIZED NET MODEL OF THE APPLYING FOR SCHOLARSHIPS AND AWARDS

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

CSE 20: Discrete Mathematics

An Essay on Complex Valued Propositional Logic

On flexible database querying via extensions to fuzzy sets

AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC

Kybernetika. Michał Baczyński; Balasubramaniam Jayaram Yager s classes of fuzzy implications: some properties and intersections

Some consequences of compactness in Lukasiewicz Predicate Logic

15414/614 Optional Lecture 1: Propositional Logic

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Intuitionistic Fuzzy Sets - An Alternative Look

02 Propositional Logic

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)

Adrian I. Ban and Delia A. Tuşe

A note on fuzzy predicate logic. Petr H jek 1. Academy of Sciences of the Czech Republic

The underlying structure in Atanassov s IFS

Computational Intelligence Lecture 13:Fuzzy Logic

cse 311: foundations of computing Fall 2015 Lecture 6: Predicate Logic, Logical Inference

Propositional Logics and their Algebraic Equivalents

2.2: Logical Equivalence: The Laws of Logic

EECS 1028 M: Discrete Mathematics for Engineers

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Comparison of Rough-set and Interval-set Models for Uncertain Reasoning

Logic, Sets, and Proofs

Intuitionistic Fuzzy Logic Control for Washing Machines

Interval based Uncertain Reasoning using Fuzzy and Rough Sets

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

Artificial Intelligence. Propositional logic

Propositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38

Chapter 4: Classical Propositional Semantics

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

On Neutrosophic α-supra Open Sets and Neutrosophic α-supra Continuous Functions

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference

Proofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.

Propositional Logic. Spring Propositional Logic Spring / 32

CSE 20 DISCRETE MATH. Winter

Correlation Analysis of Intuitionistic Fuzzy Connectives

It rains now. (true) The followings are not propositions.

Entropy for intuitionistic fuzzy sets

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction

Discrete Structures & Algorithms. Propositional Logic EECE 320 // UBC

Natural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson

Readings: Conjecture. Theorem. Rosen Section 1.5

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Max-max operation on intuitionistic fuzzy matrix. Riyaz Ahmad Padder, P. Murugadas

A TYCHONOFF THEOREM IN INTUITIONISTIC FUZZY TOPOLOGICAL SPACES

Advanced Topics in LP and FP

The Modal Logic of Pure Provability

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

NEW RESULTS IN LOGIC OF FORMULAS WHICH LOSE SENSE

CSE 20 DISCRETE MATH SPRING

CSE 20 DISCRETE MATH WINTER

Proofs. Joe Patten August 10, 2018

Logic for Computer Science - Week 4 Natural Deduction

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

Fundamentals of Logic

Propositional Dynamic Logic

Predicate Logic. Andreas Klappenecker

CSE 20 DISCRETE MATH WINTER

MACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)

PHI Propositional Logic Lecture 2. Truth Tables

A Generalized Decision Logic in Interval-set-valued Information Tables

CHAPTER 11. Introduction to Intuitionistic Logic

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.

The problem of distributivity between binary operations in bifuzzy set theory

CSE 20 DISCRETE MATH WINTER

Fuzzy Logic in Narrow Sense with Hedges

Uncertain Entailment and Modus Ponens in the Framework of Uncertain Logic

Chapter 11: Automated Proof Systems (1)

CSE 20 DISCRETE MATH. Fall

Natural Deduction for Propositional Logic

Fuzzy Modal Like Approximation Operations Based on Residuated Lattices

Equational Logic: Part 2. Roland Backhouse March 6, 2001

A Quick Lesson on Negation

Neutrosophic Resolvable and Neutrosophic Irresolvable Spaces

Propositional Logic: Part II - Syntax & Proofs 0-0

A. Propositional Logic

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Fuzzy Propositional Logic for the Knowledge Representation

Propositional Logic: Models and Proofs

Logic and Inferences

Review. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

MAT 243 Test 1 SOLUTIONS, FORM A

software design & management Gachon University Chulyun Kim

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

Chapter 4, Logic using Propositional Calculus Handout

Transcription:

BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 10 No 3 Sofia 2010 Some Remarks about L. Atanassova s Paper A New Intuitionistic Fuzzy Implication Piotr Dworniczak Department of Applied Mathematics University of Economics al. Niepodległości 10 60-967 Poznań Poland E-mail: p.dworniczakue.poznan.pl Abstract: A new class of intuitionistic fuzzy implications is introduced in the paper. Fulfillment of some of its axioms and properties together with Modus Ponens and Modus Tollens inference rules are investigated. Keywords: Fuzzy implication intuitionistic fuzzy logic intuitionistic logic. 2000 Mathematics Subject Classification Primary 03E72 Secondary 04E72. 1. Introduction The concept of Intuitionistic Fuzzy Sets (IFS) was introduced more than 25 years ago [1 8 2]. The Intuitionistic Fuzzy Logic (IFL) has been also developed in a series of papers. In this logic the truth-value of a variable x is given by the ordered pair a b where a b a+b [0 1]. The numbers a and b are interpreted as the degrees of validity and non-validity of x. We denote the truth-value of x by V (x). The variable with a truth-value true in the classical logic is denoted by 1 and the variable false by 0. For these variables it holds also that V(1) = 1 0 and V(0) = 0 1. We call the variable x an Intuitionistic Fuzzy Tautology (shortly: IFT) if and only if for V(x) = a b holds a b. Similarly we call the variable x an Intuitionistic Fuzzy co-tautology (IFcT) if and only if for V(x) = a b holds a b. 3

For every x we can define the value of negation of x in the typical form V( x) = b a. It is clear that a IFcT could by defined by IFT and. An important operator of IFL is the intuitionistic fuzzy implication. Definition 1. The fuzzy implication (definition by C z o g a ł a and Łęski [9]) is a mapping I: [0 1] 2 [0 1] where for p 1 p 2 p q 1 q 2 q [0 1] holds: (i1fl) if p 1 p 2 then I(p 1 q) I(p 2 q) (i2fl) if q 1 q 2 then I(p q 1 ) I(p q 2 ) (i3fl) I(0 q) = 1 (i4fl) I(p 1) = 1 (i5fl) I(1 0) = 0. Applying this definition to IFL firstly we will introduce some ordering relation for the intuitionistic truth-value. For V(x) = a b and V(y) = c d where a b c d a+b c+d [0 1] we denote V(x) p V(y) if and only if a c and b d. In the case of IFL conditions (i1fl)-(i5fl) for any implication are given in the form: (i1) if V(x 1 ) p V(x 2 ) then V(x 1 y) f V(x 2 y) (i2) if V(y 1 ) p V(y 2 ) then V(x y 1 ) p V(x y 2 ) (i3) 0 y is an IFT (i4) x 1 is an IFT (i5) 1 0 is an IFcT. In [7] Lilija Atanassova has introduced a new intuitionistic fuzzy implication by the formula b + c a + d V(x y) =. 2 2 This implication holds of course conditions (i1)-(i5). Consequently the truth-value of a negation generated by is given in the form b a +1 V( x) =. 2 2 We notice that this negation is not involutive i.e. in general V( ( (x))) V(x). Moreover for every x x is an IFcT and x is an IFT only for a = 0 and b = 1. Atanassova has also presented some theorems and properties of her implication as follows. 4

Theorem 1 (A t a n a s s o v a [7 Theorem 1 p. 22]). Implication (a) does not satisfy Modus Ponens in case of tautology; (b) satisfies Modus Ponens in IFT-case. For implication and negation none of the following properties are valid: Property 1. x x. Property 2. x x. Property 3. x = x. Following [11] Atanassova gives also 17 axioms that an implication should fulfill. They are: (a) x x; (b) x (y x); (c) x (y x y); (d) (x (y z)) (y (x z)); (e) (x (y z)) ((x y) (x z)); (f) x N(N(x)); (g) N(x N(x)); (h) (N(x) y) (x y); (i) N(x y) (N(x) N(y)); (j) (N(x) N(y)) N(x y); (k) (N(x) N(y)) N(x y); (l) (x y) (N(y) N(x)); (m) (x N(y)) (y N(x)); (n) N(N(N(x))) N(x); (o) N(x) N(N(N (x))); (p) N(N(x y)) (x N(N(y))); (q) (z x) ((z (x y)) (z y)) where and denote conjunction and disjunction respectively given by the formulas: V(x y) = min(a c) max(b d) V(x y) = max(a c) min(b d) while N is a negation. Implication satisfies the Axioms (a) (i) (j) (k) in IFL-case with N = while it does not satisfy none from this axioms in the classical logic case (see [7]). Besides conditions (i1)-(i5) Atanassova following K l i r and Y u a n [10 p. 308 310] gives also the axioms: (i6) V(1 y) = V(y) (i7) V(x x) = 1 (i8) V(x (y z)) = V(y (x z)) 5

(i9) V(x y) = 1 V(x) p V(y) (i10) V(x y) = V(N(y) N(x)) (i11) is a continuous function together with the theorem: implication satisfies Axioms (i8) and (i9) and Axiom (i7 ) x x is an IFT. 2. Main results Now we introduce a parametric class of fuzzy intuitionistic implications Atanassova-type. Theorem 2. An intuitionistic logical connective with a truth-value b + c + 1 a + d + 1 V(x y) = 2 2 where 1 R is an Intuitionistic Fuzzy Implication fulfilling Definition 1 with (i1)-(i5) where implication is not presented in the previous bibliography (known to the author). P r o o f. Preliminary note: b + c + 1 a + d + 1 1 + 1 [ ] [0 1] and 2 2 2 2 b + c + 1 a + d + 1 2 2 2 + [ ] [0 1] 2 2 2 2 (i1) if V(x 1 ) p V(x 2 ) then a 1 a 2 and b 1 b 2 therefore b1 + c + 1 a1 + d + 1 b2 + c + 1 a2 + d + 1 f so 2 2 2 2 V(x 1 y) f V(x 2 y) (i2) if V(y 1 ) p V(y 2 ) then c 1 c 2 and d 1 d 2 therefore b + c1 + 1 a + d1 + 1 b + c2 + 1 a + d2 + 1 p so 2 2 2 2 V(x y 1 ) p V(x y 2 ) c + d + 1 c + d + 1 (i3) V(0 y) = and that 2 2 2 2 because c d 1 so 0 y is an IFT b + (i4) V(x 1) = 2 because b a 1 so a + 1 and that 2 b + 2 a + 1 2 6

x 1 is an IFT (i5) 1 + 1 V(1 0) = so 1 0 is an IFcT. 2 2 Remark. Atanassova s implication Negation generated by b + 1 V( x) = 2 Negation is not involutive. Theorem 3. For the impication is a special case of is expressed by the formula a +. 2 and negation N = implication. holds: 1) (a) (i) (j) (k) is an IFT; 2) (b) (c) (d) (f) (g) (h) (l) (m) (n) (o) (p) (q): none of this properties is valid even in the IFT-case; 3) V( (x y)) = V( (x) (y)) V( (x y)) = V( (x) (y)). Theorem 4. Implication 1) does not satisfies property (i6) (i7) (i8) (i8 ) (i8 ) (i9) (i9 ) (i10 with N = ) where (i8 ) x (y z) is an IFT iff y (x z) is an IFT (i8 ) x (y z) is an IFcT iff y (x z) is an IFcT (i9 ) if x y is an IFT then V(x) p V(y) 2) satisfies (i10 with N= ) (i11) and (i6 ) if 1 y is an IFT then y is an IFT (i6 ) if y is an IFcT then 1 y is an IFcT (i7 ) x x is an IFT (i7 ) x x is an IFcT (i9 ) if V(x) p V(y) then x y is an IFT (i9 ) if V(x y) = 1 then V(x) p V(y) (i10 ) x y is an IFT iff (y) (x) is an IFT (i10 ) x y is an IFcT iff (y) (x) is an IFcT. Theorem 5. Implication satisfies Modus Ponens in the IFL-case (proof is elementary analogical to the proof in [7 Theorem 1 p. 22]). 7

Theorem 6. Implication satisfies Modus Tollens in the IFL-case with the negation. P r o o f. Let x y and y be IFTs. Then a b c d and c d. Hence a b 0 therefore x is an IFT. Theorem 7. Implication negation i.e. if x y is an IFT and satisfies Modus Tollens in the IFL-case with the y is an IFT then x is an IFT. P r o o f. Let x y and y be IFTs. Then a b c d and d c 1. Hence b a d c 1 what holds only if b = 1 and a = 0. b + 1 a + 1 1 Then V( x) = = therefore x is an IFT. 2 2 2 2 Negation is not involutive. Multiple use of this negation gives generally a lot of truth-values. 1 1 We denote x = x and n+ n x = ( x). Theorem 8. Negation holds for a natural number n 1 the relationships: 2 1 1) V( n b ( + 1)((2) x) = + 1 1 (2) (2 + 1)(2) a ((2) + +1 ; 1 1 (2) (2 + 1)(2) 2) V( x) = a ((2) b ( + 1)((2) + +. 2 ( 2) n (2 + 1)(2) ( 2) (2 + 1)(2) P r o o f. Based on the principle of mathematical induction (the result for =1 given by A t a n a s s o v a in [7 Theorem 2 p. 23]). Corollary 1. Corollary 2. n lim V( x) = n lim ( n 2 +1 + 1. 2 + 1 n 1 1 lim V( x) ) =. 2 2 3. Conclusion The paper presents a new class of fuzzy intuitionistic implications with their basic properties. These implications may be the subject of further research both in terms of their properties or comparisons with other intuitionistic fuzzy implications and possible applications also. For example in the broad field of economics 8

applications they may solve problems related to fuzzy control reasoning with incomplete or uncertain information or multiple criteria decision making especially with varying degrees of criteria importance. One can have doubts whether the introduction of new methods of information processing makes sense in a situation when the existing ones give satisfactory results and require simpler mathematical tools. Surely this is a topic for discussion. Similar doubts had I think the creators introducing about 40 years ago the now classical Zadeh s fuzzy sets to the field of economy technology and social sciences. Today we can say that this tool used wisely can provide tangible benefits. References 1. A t a n a s s o v K. Intuitionistic Fuzzy Sets. In: VII ITKR s Sci. Session Sofia June 1983 (Deposed in Central Sci.-Techn. Library of Bulg. Acad. of Sci. Hπ 1697/84) (in Bulgarian). 2. A t a n a s s o v K. T. Intuitionistic Fuzzy Sets. Fuzzy Sets and Systems 20 1986 87-96. 3. A t a n a s s o v K. T. Intuitionistic Fuzzy Implications and Modus Ponens. NIFS Vol. 11 2005 No 1 1-5. http://www.ifigenia.org/w/images/b/b3/nifs-11-1-01-05.pdf (1.06.2010) 4. A t a n a s s o v K. T. On Some Intuitionistic Fuzzy Implications. Compt. Rend. Acad. Bulg. Sci. Vol. 59 2006 No 1. http://www.ifigenia.org/w/images/2/2e/crbas-59-1-19-24.pdf (1.06.2010) 5. A t a n a s s o v K. T. 25 Years of Intuitionistic Fuzzy Set or the Most Interesting Results and the Most Important Mistakes of Mine. In: Advances in Fuzzy Sets Intuitionistic Fuzzy Sets Generalized Nets and Related Topics. Volume I. Foundations. K. T. Atanassov O. Hryniewicz J. Kacprzyk M. Krawczak Z. Nahorski E. Szmidt S. Zadrożny Eds. Warszawa APH EXIT 2008. 6. A t a n a s s o v K. T. On the Intuitionistic Fuzzy Implications and Negations. In: Studies in Computational Intelligence (SCI). Vol. 109. Berlin Springer 2008 381-394. http://www.springerlink.com/content/988158g428127276/fulltext.pdf (1.06.2010) 7. A t a n a s s o v a L. A New Intuitionistic Fuzzy Implication. Cybernetics and Information Technologies Vol. 9 2009 No 2 21-25. http://www.cit.iit.bas.bg/cit_09/v9-2/21-25.pdf (1.06.2010) 8. A t a n a s s o v K. S. S t o e v a. Intuitionistic Fuzzy Sets. In: Proc. of the Polish Symposium on Interval & Fuzzy Mathematics. J. Albrycht H. Wiśniewski Eds. Poznań 1985. 9. Czogał a E. J. Łęs k i. On Equivalence of Approximate Reasoning Results Using Different Interpretations of Fuzzy If-Then Rules. Fuzzy Sets and Systems Vol. 117 2001 279-296. 10. K l i r G. J. B. Y u a n. Fuzzy Sets and Fuzzy Logic. New Jersey Prentice Hall PTR 1995. 11. R a s i o w a H. R. S i k o r s k i. The Mathematics of Metamathematics. Warszawa Polish Academy of Science (PAN) 1963. 9