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

Size: px
Start display at page:

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

Transcription

1 LGRIN DEMY OF SIENES YERNETIS ND INFORMTION TEHNOLOGIES Volume No 3 Sofia 0 Inclusion of the Intuitionistic Fuzzy Sets ased on Some Weak Intuitionistic Fuzzy Implication Piotr Dworniczak Department of pplied Mathematics niversity of Economics al. Niepodległości Poznań Poland p.dworniczak@ue.poznan.pl bstract: The definition of the Parametric of Inclusion Degree PID of the intuitionistic fuzzy sets on the basis of the weak intuitionistic fuzzy implication is presented in the paper. The aioms which the inclusion measure must fulfill noticed in recent literature are given. The theorems present which of the aioms are met and which are not met by the newly introduced PID. Since the PID fulfills the basic aioms although some in a soft way it can be an alternative to other more hard measures of inclusion. Keywords: Intuitionistic fuzzy sets set inclusion intuitionistic fuzzy implication.. rief introduction to Intuitionistic Fuzzy Sets IFS In 965 L.. Zadeh defined the fuzzy set as Z { Z : } where Z is the value of function Z : [0 ] on a universe called the membership function. The family of all fuzzy sets on the universe we denote as FS. In 983 K. tanassov defined some generalization of Zadeh s fuzzy sets. Definition. Intuitionistic fuzzy set on a universe is understood as { : }

2 where and are functions from to a closed interval [0 ] and for every holds. The values and are respectively the degree of membership and the degree of non-membership of element to the set. We would understand as a couple. nlike in classical fuzzy sets the values of and are independent on each other omitting. The family of all intuitionistic fuzzy sets on we denote as IFS. s classic fuzzy sets are associated with fuzzy logic the IFSs are associated with the so called Intuitionistic Fuzzy Logic IFL. In this logic the truth-value of the propositional variable p is given by an ordered couple a b where a b ab [0 ]. This pair will be called an Intuitionistic Fuzzy Value IFV and the set { a b [0 ] : a b } will be denoted by L. The numbers a and b are interpreted as the validity- and non-validity-degree of the variable p. The truthvalue of the variable p we denote by Vp. The variable with a truth-value true in classical logic is denoted by and the variable false by 0. For this variables holds also V 0 and V0 0. Moreover some kind of fuzzy truth-value is distinguished. We call the variable an Intuitionistic Fuzzy Tautology IFT when for V a b holds: a b and similarly an Intuitionistic Fuzzy co-tautology IFcT if a b holds. The IFT is therefore a variable at least as true as false or rather true. For every we can define the value of negation of in the typical form V b a. onsequently the set c { : } is the standard complement of. In intuitionistic fuzzy propositional calculus Intuitionistic Fuzzy Implication is an important operator. Definition. The weak intuitionistic fuzzy implication is a mapping fulfilling for any variable p p p q q q the properties: i if Vp p Vp then Vp q f Vp q i if Vq p Vq then Vp q p Vp q i3 0 q is an IFT i4 p is an IFT i5 0 is an IFcT where p is a fuzzy ordering relation in the set of an intuitionistic fuzzy variable. Definition is given based on the definition of fuzzy implication a c z y ń ski Jayaram [3 p. ]. 3

3 For the variable p and q with Vp a b and Vq c d we denote Vp p Vq if and only if a c and b d. We call this implication weak implication because properties i3 i4 and i5 are also given in the typical strong form V0 q Vp 0 and V 0 0. There are many postulated properties in literature which the fuzzy implication must meet. Significantly fewer properties are given eactly for the intuitionistic fuzzy implication. They are usually etensions of the fuzzy implications aioms. The main ones are given below.. Strict and graded inclusion in intuitionistic fuzzy environment In theory both classical sets and their generalizations as well as suggestions to use the concept of inclusion is very important. In the case of vague sets the inclusion is not determined unambiguously. It is related to the various definitions of multivalued implications different concepts of cardinalities or even with an ambiguous definition of inclusion. In intuitionistic fuzzy environment the problems are similar. In this paper the conditions that the measure of inclusion must fulfill are presented in a brief literature overview. parametric inclusion degree based on the weak intuitionistic fuzzy implication is introduced. In the paper Fuzzy Sets L.. Zadeh gives a basic definition of the inclusion of two fuzzy sets. Denoted by FS inclusion in Zadeh s sense this definition can be written as follows. Definition 3. Let Y Z FS. It is Y FS Z iff : Y Z. This definition allows the stating of a kind of absolute strict inclusion. Therefore in this case the varying degrees of inclusion relationships are not highlighted. So other different definitions of the inclusion with an inclusion degree in the interval [0 ] are considered. Formally this degree is a value of the mapping I FS : FS FS [0 ] and must meet certain conditions. n etension of this idea is the definition of the IFSs inclusion. Definition 4. Let IFS. It is IFS iff : and. It is easy to notice that the inclusion stated in this way is also rigid. It allows us to respond negatively to both the inclusion of sets { 0: } and { 0 : } and sets with identical membership function and nonmembership function different only at one point 0 in which 0 < 0. Due to the doubts depicted in the eample above different definitions of inclusions and inclusions degree are also introduced for IFSs. sing the operators and given by tanassov as { : } and { : } we can consider also a weaker inclusion in the form 4

4 iff : or iff :. We denote that these two inclusions are really the crisp inclusions of fuzzy sets because FS. nother generalization is the proposal of the designate of the inclusion degree using the mapping I IFS : IFS IFS [0 ] with real values or ID IFS : IFS IFS L with intuitionistic fuzzy values. While defining the degree of inclusions it is most often considered what set of aioms must be adopted for function I IFS and what for ID IFS so that their values could be considered as inclusion degrees. The aioms proposed are usually an etension of the aioms known for fuzzy sets. In various sources there is no compliance even with respect to their canon. sually the aioms proposed are a consequence of the approach given by S i n h a and D o u g h e r t y [4] and also independently by K i t a i n i k [0]. The analysis of the work of Sinha Dougherty and Kitainik is contained in [6]. o r n e l i s and K e r r e [7] etend the approach given also in [6]. ccording to them an intuitionistic fuzzy inclusion measure Inc is an IFS IFS L mapping fulfilling: K Inc Inc c c ; K Inc INFInc Inc where denotes the classical intersection with INF INF def min ma ; K 3 Inc IncP P where P is a IFS IFS mapping defined for as P p and p is a permutation of ; K 4a Inc 0 iff IFS ; K 4b Inc 0 iff : 0 and 0 ; K 4c if FS then Inc D where D { a b L: ab}. The properties K -K 4 are called contrapositivity distributivity symmetry and faithfulness respectively. The property K 4c is called a heritage condition. V l a c h o s and S e r g i a d i s [5] and later X i e H a n and M i [6] state that the subsethood measure or the inclusion measure Inc: IFS IFS [0 ] must fulfill the following properties: VS Inc iff IFS ; VS if c IFS then Inc c 0 iff IFS where IFS { 0: }; VS 3a if IFS IFS then Inc Inc ; 5

5 VS 3b if IFS then Inc Inc. L u o and Y u [] proposed the inclusion degree function in the form Inc: IFS IFS [0 ] satisfying: LY if IFS then Inc ; LY Inc IFS IFS 0 where IFS { 0 : }; LY 3 if IFS IFS then Inc mininc Inc. Q u i a n L i a n g and D a n g [3] considering the inclusion not directly IFSs have established that the degree for the set included in set must be a number from the closed interval [0 ] fulfilling properties LY and VS 3b only. In a recent publication G r z e g o r z e w s k i [9] gives a new approach to the inclusion degree defining the possible and necessary inclusion degree of IFSs but he gives the aioms only for FS called mapping Inc: FS FS [0 ] an inclusion indicator or subsethood measure. The indicator must fulfill the aioms equivalent to K 4a K 4b K and K and the fifth aiom: Inc IncΦ Φ where Φ: FS FS is a mapping defined by Φ φ with φ denoting a function φ:. Let us note that this aiom is strange if φ can be any function. onsidering for eample {t s} and {0/s /t} and {0/s 0/t} if K 4a must be satisfied then Inc is obtained. However taking for eample a fied function φ s we obtain Φ {0/t 0/s} Φ and further IncΦ Φ Inc. Maybe some additional conditions must be imposed on function φ probably as in K 3. Later in this paper this aiom will not be considered. The inclusion degree must be the measure of orming about to what etent how much the set is contained in. Otherwise this degree can be understood as a measure related to the classical definition of the inclusion of in which is as follows: iff : class where class denoted the classical implication. The quantifier for all means that the implication must be true for all elements of. If the values of the implications are the IF values then all of them would have the value 0. This is a very sharp assumption. That is why in the fuzzy environment we usually define the inclusion of sets not in the form yes/no but yes to some degree. If we epand the classical definition recognizing the quantifier for all as the conjunction of all implications for we will get the basic method for calculating the inclusion degree in the form based on idea of a n d l e r and K o h o u t [4]: where Inc INF V 6

6 INF a b def a b. We note that an inclusion degree of the IFSs could be defined also in other forms based on the cardinality of the appropriate sets or on the basis of their distance. 3. The parametric inclusion degree Lemma. The parametric intuitionistic logical connective with a truth-value: b c a d V y where V a b Vy c d and R is a Weak Intuitionistic Fuzzy Implication fulfilling Definition see: [8]. Definition 5. Let IFS. We call the value PID INF V L a Parametric Inclusion Degree PID of into. Remarks Remark. If IFS and IFS then PID is an IFT and PID D is an IFcT. Remark. PID 0 iff and IFS and IFS. Remark 3. PID is an IFT but PID 0. Remark 4. There does not eist any for which PID 0. The following theorems provide fulfillment of the aioms given in the references by PID. We note that the aioms VS and LY relate to the measures of the inclusion with values from the interval [0 ]. In the net theorems we consider the adequate aioms with values in L. Theorem. The Parametric Inclusion Degree fulfills the aioms: a PID K : PID PID c c ; b PID K : PID INFPID PID ; c PID 3 K 3: PID PIDP P where P is a IFS IFS mapping defined for as P p where p is a permutation of ; d PID 4 K 4c: if FS then PID D { a b L: ab}; e PID 5 VS 3a: if IFS IFS then PID p PID ; D 7

7 8 f PID 6 VS 3b: if IFS then PID p PID ; g PID 7 LY 3: if IFS IFS then PID p INFPID PID. P r o o f: a PID INF V INF INF V c c PID c c. b PID INF V INF V INF INF min ma INF min ma INF INF INF INF INF INFPID PID. c PID y INF Vy y p INF Vp p INF Vp p PIDP P. d If FS then and. Therefore PID INF

8 9 * D. The equality * holds because for f[0 ] the property { f} { f} is valid. e IFS IFS means : and :. y definition PID INF and PID INF. ecause : then and because : then therefore PID p PID. f nalogous to e. g Readily apparent from e and f Theorem. The Parametric Inclusion Degree does not fulfill the aioms: a K 4a VS but holds PID 8a: if PID 0 then IFS ; PID 8b: if IFS then PID is an IFT; b K 4b but holds PID 9a: if PID 0 then : 0 and 0 ; PID 9b: if : 0 and 0 then PID is an IFcT; c VS ; d LY ; e LY. P r o o f: a PID 0 iff INF 0

9 0 iff : and 0 iff : and. ecause then and 0. If PID 0 then and : and 0. So it is obtained : 0 and 0 therefore IFS. In the other direction let IFS this means : and. The inequality is equivalent to and this holds because : 0 and 0. In the second case if it were otherwise there would eist such that >0 i. e. >. ut from the assumption therefore the sum > which is impossible. s a result PID is an IFT. b ased on Remark 4 property PID 9a is formally fulfilled. The property PID 9b is fulfilled because if : 0 and 0 then and and because so PID D is an IFcT. c Readily apparent from Definition 5 and Remark 4. d Readily apparent from Theorem a and PID 8b. e Readily apparent from Definition 5 and Remark 4 Remarks Remark 5. If IFS then PID f PID. P r o o f: Let IFS. y definition PID PID. Since : and and therefore and similarly.

10 Finally PID f PID Remark 6. The property PID 5 can be etended to: PID 5a: if IFS then PID p PID. Remark 7. The property PID 9b can be etended to the form PID 9c: if 0 : score 0 score 0 then PID is an IFcT where score :. Namely it is 0 0 * 0 0 and inequality * holds therefore from the assumption 0 : which is equivalent to onclusion The definition of the parametric degree of inclusion of intuitionistic fuzzy sets on the basis of weak intuitionistic implication is presented in the paper. The aioms which must fulfill the inclusion measure noticed in recent literature are given. The theorems indicate which of the aioms are met and which are not met by the newly introduced inclusion degree PID. Since PID fulfills the basic aioms although some of them in a soft way it can be an alternative to other more hard measures of inclusion. Some properties may be difficult to accept for eample the contained in Remark 3 property PID 0. We note however that the properties of PID allow its use in some applications for eample to determine the optimal solution based on the level of inclusion of the IFS describing the solution and IFSs describing the best or worst solution. References. t a n a s s o v K. T. Intuitionistic Fuzzy Sets. Fuzzy Sets and Systems t a n a s s o v K. T. New Operations Defined Over the Intuitionistic Fuzzy Sets. Fuzzy Sets and Systems a c z y ń s k i M.. J a y a r a m. Fuzzy Implications. erlin Springer a n d l e r W. L. J. K o h o u t. Fuzzy Power Sets and Fuzzy Implication Operators. Fuzzy Sets and Systems o s c P. O. P i v e r t. bout pproimate Inclusion and its iomatization. Fuzzy Sets and Systems o r n e l i s.. V a n d e r D o n c k E. K e r r e. Sinha-Dougherty pproach to the Fuzzification of Set Inclusion Revisited. Fuzzy Sets and Systems o r n e l i s. E. K e r r e. Inclusion Measures in Intuitionistic Fuzzy Set Theory. In: T. D. Nielsen N. L. Zhang Eds. ESQR 003 LNI 7. erlin Springer D w o r n i c z a k P. On One lass of Intuitionistic Fuzzy Implications. ybernetics and Information Technologies Vol No 4 3-.

11 9. G r z e g o r z e w s k i P. On Possible and Necessary Inclusion of Intuitionistic Fuzzy Sets. Information Sciences K i t a i n i k L. Fuzzy Decision Procedures with inary Relations. Dordrecht Kluwer K i t a i n i k L. Fuzzy Implication and Fuzzy Inclusion: omparative iomatic Study. In: R. Lowen M. Roubens Eds. Fuzzy Logic-State of the rt. Dordrecht Kluwer L u o Y. h. Y u. Fuzzy Optimization Method for Multi-riteria Decision-Making Problem ased on the Inclusion Degrees of Intuitionistic Fuzzy Sets. Journal of Information and omputing Science Vol No Q u i a n Y. J. L i a n g h. D a n g. onsistency Measure Inclusion Degree and Fuzzy Measure in Decision Tables. Fuzzy Sets and Systems S i n h a D. E. R. D o u g h e r t y. Fuzzification of Set Inclusion: Theory and pplications. Fuzzy Sets and Systems V l a c h o s I. K. G. D. S e r g i a d i s. Subsethood Entropy and ardinality for Interval-Valued Fuzzy Sets n lgebraic Derivation. Fuzzy Sets and Systems X i e. L-W. H a n J-S. M i. Inclusion Measure and Similarity Measure of Intuitionistic Fuzzy Sets. In: Proc. of the Eighth International onference on Machine Learning and ybernetics aoding

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

Some Remarks about L. Atanassova s Paper A New Intuitionistic Fuzzy Implication 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

More information

Introducing Interpolative Boolean algebra into Intuitionistic

Introducing Interpolative Boolean algebra into Intuitionistic 16th World Congress of the International Fuzzy Systems ssociation (IFS) 9th Conference of the European Society for Fuzzy Logic and Technology (EUSFLT) Introducing Interpolative oolean algebra into Intuitionistic

More information

Multi-period medical diagnosis method using a single valued. neutrosophic similarity measure based on tangent function

Multi-period medical diagnosis method using a single valued. neutrosophic similarity measure based on tangent function *Manuscript Click here to view linked References 1 1 1 1 1 1 1 0 1 0 1 0 1 0 1 0 1 Multi-period medical diagnosis method using a single valued neutrosophic similarity measure based on tangent function

More information

Intuitionistic Fuzzy Sets - An Alternative Look

Intuitionistic Fuzzy Sets - An Alternative Look Intuitionistic Fuzzy Sets - An Alternative Look Anna Pankowska and Maciej Wygralak Faculty of Mathematics and Computer Science Adam Mickiewicz University Umultowska 87, 61-614 Poznań, Poland e-mail: wygralak@math.amu.edu.pl

More information

Where are we? Operations on fuzzy sets (cont.) Fuzzy Logic. Motivation. Crisp and fuzzy sets. Examples

Where are we? Operations on fuzzy sets (cont.) Fuzzy Logic. Motivation. Crisp and fuzzy sets. Examples Operations on fuzzy sets (cont.) G. J. Klir, B. Yuan, Fuzzy Sets and Fuzzy Logic: Theory and Applications, Prentice-Hall, chapters -5 Where are we? Motivation Crisp and fuzzy sets alpha-cuts, support,

More information

A New Intuitionistic Fuzzy Implication

A New Intuitionistic Fuzzy Implication BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 9, No Sofia 009 A New Intuitionistic Fuzzy Implication Lilija Atanassova Institute of Information Technologies, 1113 Sofia

More information

On the Intersections of QL-Implications with (S, N)- and R-Implications

On the Intersections of QL-Implications with (S, N)- and R-Implications On the Intersections of QL-Implications with (S, N)- and R-Implications Balasubramaniam Jayaram Dept. of Mathematics and Computer Sciences, Sri Sathya Sai Institute of Higher Learning, Prasanthi Nilayam,

More information

Liu s Generalized Intuitionistic Fuzzy Sets

Liu s Generalized Intuitionistic Fuzzy Sets iu s Generalized Intuitionistic Fuzzy Sets 測驗統計年刊第十八輯 iu s Generalized Intuitionistic Fuzzy Sets Hsiang-Chuan iu Department of Bioinformatics & Department of Psychology, sia University bstract In this

More information

Fuzzy and Rough Sets Part I

Fuzzy and Rough Sets Part I Fuzzy and Rough Sets Part I Decision Systems Group Brigham and Women s Hospital, Harvard Medical School Harvard-MIT Division of Health Sciences and Technology Aim Present aspects of fuzzy and rough sets.

More information

Learning Goals of CS245 Logic and Computation

Learning Goals of CS245 Logic and Computation Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction

More information

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

What is Logic? Introduction to Logic. Simple Statements. Which one is statement? What is Logic? Introduction to Logic Peter Lo Logic is the study of reasoning It is specifically concerned with whether reasoning is correct Logic is also known as Propositional Calculus CS218 Peter Lo

More information

On flexible database querying via extensions to fuzzy sets

On flexible database querying via extensions to fuzzy sets On flexible database querying via extensions to fuzzy sets Guy de Tré, Rita de Caluwe Computer Science Laboratory Ghent University Sint-Pietersnieuwstraat 41, B-9000 Ghent, Belgium {guy.detre,rita.decaluwe}@ugent.be

More information

Chapter 4: Classical Propositional Semantics

Chapter 4: Classical Propositional Semantics Chapter 4: Classical Propositional Semantics Language : L {,,, }. Classical Semantics assumptions: TWO VALUES: there are only two logical values: truth (T) and false (F), and EXTENSIONALITY: the logical

More information

Logic. Def. A Proposition is a statement that is either true or false.

Logic. Def. A Proposition is a statement that is either true or false. Logic Logic 1 Def. A Proposition is a statement that is either true or false. Examples: Which of the following are propositions? Statement Proposition (yes or no) If yes, then determine if it is true or

More information

Applied Logic. Lecture 3 part 1 - Fuzzy logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw

Applied Logic. Lecture 3 part 1 - Fuzzy logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw Applied Logic Lecture 3 part 1 - Fuzzy logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018 1

More information

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Packet #1: Logic & Proofs. Applied Discrete Mathematics Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should

More information

Truth-Functional Logic

Truth-Functional Logic Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence

More information

Logic, Sets, and Proofs

Logic, Sets, and Proofs Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.

More information

Rough Soft Sets: A novel Approach

Rough Soft Sets: A novel Approach International Journal of Computational pplied Mathematics. ISSN 1819-4966 Volume 12, Number 2 (2017), pp. 537-543 Research India Publications http://www.ripublication.com Rough Soft Sets: novel pproach

More information

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.

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. Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is

More information

Correlation Analysis of Intuitionistic Fuzzy Connectives

Correlation Analysis of Intuitionistic Fuzzy Connectives Proceeding Series of the Brazilian Society of Applied and Computational Mathematics, Vol. 5, N. 1, 017. Trabalho apresentado no CNMAC, Gramado - RS, 016. Proceeding Series of the Brazilian Society of Computational

More information

Note: The area of logic that deals with propositions is called the propositional calculus or propositional logic.

Note: The area of logic that deals with propositions is called the propositional calculus or propositional logic. Ch. 1.1 Logic Logic 1 Def. A Proposition is a statement that is either true or false. Example 1: Which of the following are propositions? Statement Proposition (yes or no) UHD is a University 1 + 3 = 0

More information

AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC

AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC Iranian Journal of Fuzzy Systems Vol. 9, No. 6, (2012) pp. 31-41 31 AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC E. ESLAMI Abstract. In this paper we extend the notion of degrees of membership

More information

PROPOSITIONAL CALCULUS

PROPOSITIONAL CALCULUS PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and

More information

Preservation of graded properties of fuzzy relations by aggregation functions

Preservation of graded properties of fuzzy relations by aggregation functions Preservation of graded properties of fuzzy relations by aggregation functions Urszula Dudziak Institute of Mathematics, University of Rzeszów, 35-310 Rzeszów, ul. Rejtana 16a, Poland. e-mail: ududziak@univ.rzeszow.pl

More information

arxiv: v1 [cs.lo] 16 Jul 2017

arxiv: v1 [cs.lo] 16 Jul 2017 SOME IMPROVEMENTS IN FUZZY TURING MACHINES HADI FARAHANI arxiv:1707.05311v1 [cs.lo] 16 Jul 2017 Department of Computer Science, Shahid Beheshti University, G.C, Tehran, Iran h farahani@sbu.ac.ir Abstract.

More information

Financial Informatics IX: Fuzzy Sets

Financial Informatics IX: Fuzzy Sets Financial Informatics IX: Fuzzy Sets Khurshid Ahmad, Professor of Computer Science, Department of Computer Science Trinity College, Dublin-2, IRELAND November 19th, 2008 https://www.cs.tcd.ie/khurshid.ahmad/teaching.html

More information

Chapter 11: Automated Proof Systems

Chapter 11: Automated Proof Systems Chapter 11: Automated Proof Systems SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems are

More information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements

More information

Chapter 11: Automated Proof Systems (1)

Chapter 11: Automated Proof Systems (1) Chapter 11: Automated Proof Systems (1) SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems

More information

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

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook) Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or

More information

A Study on Intuitionistic Fuzzy Number Group

A Study on Intuitionistic Fuzzy Number Group International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 2, Number 3 (2012), pp. 269-277 Research India Publications http://www.ripublication.com Study on Intuitionistic Fuzzy Number

More information

2.2: Logical Equivalence: The Laws of Logic

2.2: Logical Equivalence: The Laws of Logic Example (2.7) For primitive statement p and q, construct a truth table for each of the following compound statements. a) p q b) p q Here we see that the corresponding truth tables for two statement p q

More information

New Similarity Measures for Intuitionistic Fuzzy Sets

New Similarity Measures for Intuitionistic Fuzzy Sets Applied Mathematical Sciences, Vol. 8, 2014, no. 45, 2239-2250 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.43171 New Similarity Measures for Intuitionistic Fuzzy Sets Peerasak Intarapaiboon

More information

Propositional Logic, Predicates, and Equivalence

Propositional Logic, Predicates, and Equivalence Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If

More information

Rule-Based Fuzzy Model

Rule-Based Fuzzy Model In rule-based fuzzy systems, the relationships between variables are represented by means of fuzzy if then rules of the following general form: Ifantecedent proposition then consequent proposition The

More information

Similarity-based Classification with Dominance-based Decision Rules

Similarity-based Classification with Dominance-based Decision Rules Similarity-based Classification with Dominance-based Decision Rules Marcin Szeląg, Salvatore Greco 2,3, Roman Słowiński,4 Institute of Computing Science, Poznań University of Technology, 60-965 Poznań,

More information

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false. Section 1.2 Propositional Equivalences A tautology is a proposition which is always true. Classic Example: P P A contradiction is a proposition which is always false. Classic Example: P P A contingency

More information

Measure of Distance and Similarity for Single Valued Neutrosophic Sets with Application in Multi-attribute

Measure of Distance and Similarity for Single Valued Neutrosophic Sets with Application in Multi-attribute Measure of Distance and imilarity for ingle Valued Neutrosophic ets ith pplication in Multi-attribute Decision Making *Dr. Pratiksha Tiari * ssistant Professor, Delhi Institute of dvanced tudies, Delhi,

More information

CSC Discrete Math I, Spring Propositional Logic

CSC Discrete Math I, Spring Propositional Logic CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)

More information

Ath. Kehagias and M. Konstantinidou. "L-Fuzzy Valued Inclusion Measure, L-Fuzzy Similarity and L-Fuzzy Distance".

Ath. Kehagias and M. Konstantinidou. L-Fuzzy Valued Inclusion Measure, L-Fuzzy Similarity and L-Fuzzy Distance. Ath. Kehagias and M. Konstantinidou. "L-Fuzzy Valued Inclusion Measure, L-Fuzzy Similarity and L-Fuzzy Distance". This paper will appear in the journal: Fuzzy Sets and Systems L-Fuzzy Valued Inclusion

More information

Game Semantical Rules for Vague Proportional Semi-Fuzzy Quantifiers

Game Semantical Rules for Vague Proportional Semi-Fuzzy Quantifiers Game Semantical Rules for Vague Proportional Semi-Fuzzy Quantifiers Matthias F.J. Hofer Vienna University of Technology Vague quantifier expressions like about half or almost all, and their semantics,

More information

Compound Propositions

Compound Propositions Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth

More information

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic Discrete Mathematical Structures Chapter 1 he oundation: Logic 1 Lecture Overview 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Quantifiers l l l l l Statement Logical Connectives Conjunction

More information

Friedman s test with missing observations

Friedman s test with missing observations Friedman s test with missing observations Edyta Mrówka and Przemys law Grzegorzewski Systems Research Institute, Polish Academy of Sciences Newelska 6, 01-447 Warsaw, Poland e-mail: mrowka@ibspan.waw.pl,

More information

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

Kybernetika. Michał Baczyński; Balasubramaniam Jayaram Yager s classes of fuzzy implications: some properties and intersections Kybernetika Michał Baczyński; Balasubramaniam Jayaram Yager s classes of fuzzy implications: some properties and intersections Kybernetika, Vol. 43 (2007), No. 2, 57--82 Persistent URL: http://dml.cz/dmlcz/35764

More information

Comp487/587 - Boolean Formulas

Comp487/587 - Boolean Formulas Comp487/587 - Boolean Formulas 1 Logic and SAT 1.1 What is a Boolean Formula Logic is a way through which we can analyze and reason about simple or complicated events. In particular, we are interested

More information

Classical Propositional Logic

Classical Propositional Logic The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,

More information

Classical Logic and Neutrosophic Logic. Answers to K. Georgiev

Classical Logic and Neutrosophic Logic. Answers to K. Georgiev 79 University of New Mexico Classical Logic and Neutrosophic Logic. Answers to K. Georgiev Florentin Smarandache 1 1 University of New Mexico, Mathematics & Science Department, 705 Gurley Ave., Gallup,

More information

Logic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 2 Circuit Optimization

Logic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 2 Circuit Optimization Logic and omputer Design Fundamentals hapter 2 ombinational Logic ircuits Part 2 ircuit Optimization harles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode)

More information

Uninorm trust propagation and aggregation methods for group decision making in social network with four tuple information

Uninorm trust propagation and aggregation methods for group decision making in social network with four tuple information Uninorm trust propagation and aggregation methods for group decision making in social network with four tuple information Jian Wu a,b, Ruoyun Xiong a, Francisco Chiclana b a School of Economics and Management,

More information

Automata Theory and Formal Grammars: Lecture 1

Automata Theory and Formal Grammars: Lecture 1 Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)

More information

-Complement of Intuitionistic. Fuzzy Graph Structure

-Complement of Intuitionistic. Fuzzy Graph Structure International Mathematical Forum, Vol. 12, 2017, no. 5, 241-250 HIKRI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2017.612171 -Complement of Intuitionistic Fuzzy Graph Structure Vandana ansal Department

More information

Cross-entropy measure on interval neutrosophic sets and its applications in Multicriteria decision making

Cross-entropy measure on interval neutrosophic sets and its applications in Multicriteria decision making Manuscript Click here to download Manuscript: Cross-entropy measure on interval neutrosophic sets and its application in MCDM.pdf 1 1 1 1 1 1 1 0 1 0 1 0 1 0 1 0 1 Cross-entropy measure on interval neutrosophic

More information

IF (some things are true), then (some other thing is true).

IF (some things are true), then (some other thing is true). Student Notes Student Study Session Topic: Important Theorems Facts, truth, ideas, etc. in mathematics are known as definitions, theorems, and postulates (also known as aioms or assumptions). Theorems

More information

INTUITIONISTIC FUZZY TOPOLOGICAL SPACES

INTUITIONISTIC FUZZY TOPOLOGICAL SPACES INTUITIONISTIC FUZZY TOPOLOGICAL SPACES A THESIS SUBMITTED TO THE NATIONAL INSTITUTE OF TECHNOLOGY, ROURKELA IN THE PARTIAL FULFILMENT FOR THE DEGREE OF MASTER OF SCIENCE IN MATHEMATICS BY SMRUTILEKHA

More information

Propositional Logic: Equivalence

Propositional Logic: Equivalence Propositional Logic: Equivalence Alice Gao Lecture 5 Based on work by J. Buss, L. Kari, A. Lubiw, B. Bonakdarpour, D. Maftuleac, C. Roberts, R. Trefler, and P. Van Beek 1/42 Outline Propositional Logic:

More information

Left-continuous t-norms in Fuzzy Logic: an Overview

Left-continuous t-norms in Fuzzy Logic: an Overview Left-continuous t-norms in Fuzzy Logic: an Overview János Fodor Dept. of Biomathematics and Informatics, Faculty of Veterinary Sci. Szent István University, István u. 2, H-1078 Budapest, Hungary E-mail:

More information

MATHS 315 Mathematical Logic

MATHS 315 Mathematical Logic MATHS 315 Mathematical Logic Second Semester, 2007 Contents 1 Informal Statement Logic 1 1.1 Statements and truth tables............................... 1 1.2 Tautologies, logical equivalence and logical

More information

Motivation. From Propositions To Fuzzy Logic and Rules. Propositional Logic What is a proposition anyway? Outline

Motivation. From Propositions To Fuzzy Logic and Rules. Propositional Logic What is a proposition anyway? Outline Harvard-MIT Division of Health Sciences and Technology HST.951J: Medical Decision Support, Fall 2005 Instructors: Professor Lucila Ohno-Machado and Professor Staal Vinterbo Motivation From Propositions

More information

Generalised Atanassov Intuitionistic Fuzzy Sets

Generalised Atanassov Intuitionistic Fuzzy Sets eknow 23 : The Fifth International Conference on Information, Process, and Knowledge Management Generalised Atanassov Intuitionistic Fuzzy Sets Ioan Despi School of Science and Technology University of

More information

Probability of fuzzy events

Probability of fuzzy events Probability of fuzzy events 1 Introduction Ondřej Pavlačka 1, Pavla Rotterová 2 Abstract. In economic practice, we often deal with events that are defined only vaguely. Such indeterminate events can be

More information

i jand Y U. Let a relation R U U be an

i jand Y U. Let a relation R U U be an Dependency Through xiomatic pproach On Rough Set Theory Nilaratna Kalia Deptt. Of Mathematics and Computer Science Upendra Nath College, Nalagaja PIN: 757073, Mayurbhanj, Orissa India bstract: The idea

More information

Mat 243 Exam 1 Review

Mat 243 Exam 1 Review OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for

More information

On Proofs and Rule of Multiplication in Fuzzy Attribute Logic

On Proofs and Rule of Multiplication in Fuzzy Attribute Logic On Proofs and Rule of Multiplication in Fuzzy Attribute Logic Radim Belohlavek 1,2 and Vilem Vychodil 2 1 Dept. Systems Science and Industrial Engineering, Binghamton University SUNY Binghamton, NY 13902,

More information

AN INTRODUCTION TO FUZZY SOFT TOPOLOGICAL SPACES

AN INTRODUCTION TO FUZZY SOFT TOPOLOGICAL SPACES Hacettepe Journal of Mathematics and Statistics Volume 43 (2) (2014), 193 204 AN INTRODUCTION TO FUZZY SOFT TOPOLOGICAL SPACES Abdülkadir Aygünoǧlu Vildan Çetkin Halis Aygün Abstract The aim of this study

More information

7. Propositional Logic. Wolfram Burgard and Bernhard Nebel

7. Propositional Logic. Wolfram Burgard and Bernhard Nebel Foundations of AI 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard and Bernhard Nebel Contents Agents that think rationally The wumpus world Propositional logic: syntax and semantics

More information

More Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences. Computability and Logic

More Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences. Computability and Logic More Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences Computability and Logic Equivalences Involving Conditionals Some Important Equivalences Involving Conditionals

More information

ATANASSOV S INTUITIONISTIC FUZZY SET THEORY APPLIED TO QUANTALES

ATANASSOV S INTUITIONISTIC FUZZY SET THEORY APPLIED TO QUANTALES Novi Sad J. Math. Vol. 47, No. 2, 2017, 47-61 ATANASSOV S INTUITIONISTIC FUZZY SET THEORY APPLIED TO QUANTALES Bijan Davvaz 1, Asghar Khan 23 Mohsin Khan 4 Abstract. The main goal of this paper is to study

More information

A Generalized Fuzzy Inaccuracy Measure of Order ɑ and Type β and Coding Theorems

A Generalized Fuzzy Inaccuracy Measure of Order ɑ and Type β and Coding Theorems International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 4, Number (204), pp. 27-37 Research India Publications http://www.ripublication.com A Generalized Fuzzy Inaccuracy Measure

More information

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

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference CSI 2350, Discrete Structures Chapter 1, Logic and Proofs (3) Young-Rae Cho Associate Professor Department of Computer Science Baylor University 1.6. Rules of Inference Basic Terminology Axiom: a statement

More information

Compenzational Vagueness

Compenzational Vagueness Compenzational Vagueness Milan Mareš Institute of information Theory and Automation Academy of Sciences of the Czech Republic P. O. Box 18, 182 08 Praha 8, Czech Republic mares@utia.cas.cz Abstract Some

More information

Implications from data with fuzzy attributes

Implications from data with fuzzy attributes Implications from data with fuzzy attributes Radim Bělohlávek, Martina Chlupová, and Vilém Vychodil Dept. Computer Science, Palacký University, Tomkova 40, CZ-779 00, Olomouc, Czech Republic Email: {radim.belohlavek,

More information

Duality vs Adjunction and General Form for Fuzzy Mathematical Morphology

Duality vs Adjunction and General Form for Fuzzy Mathematical Morphology Duality vs Adjunction and General Form for Fuzzy Mathematical Morphology Isabelle Bloch GET - Ecole Nationale Supérieure des Télécommunications, Dept. TSI - CNRS UMR 5141 LTCI, 46 rue Barrault, 7513 Paris,

More information

Proving simple set properties...

Proving simple set properties... Proving simple set properties... Part 1: Some examples of proofs over sets Fall 2013 Proving simple set properties... Fall 2013 1 / 17 Introduction Overview: Learning outcomes In this session we will...

More information

CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS

CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS 1 Language There are several propositional languages that are routinely called classical propositional logic languages. It is due to the functional dependency

More information

CSCE 222 Discrete Structures for Computing. Propositional Logic. Dr. Hyunyoung Lee. !!!!!! Based on slides by Andreas Klappenecker

CSCE 222 Discrete Structures for Computing. Propositional Logic. Dr. Hyunyoung Lee. !!!!!! Based on slides by Andreas Klappenecker CSCE 222 Discrete Structures for Computing Propositional Logic Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Propositions A proposition is a declarative sentence that is either true or false

More information

Propositional Logic. Yimei Xiang 11 February format strictly follow the laws and never skip any step.

Propositional Logic. Yimei Xiang 11 February format strictly follow the laws and never skip any step. Propositional Logic Yimei Xiang yxiang@fas.harvard.edu 11 February 2014 1 Review Recursive definition Set up the basis Generate new members with rules Exclude the rest Subsets vs. proper subsets Sets of

More information

Comparison of Extended Fuzzy Logic Models of A-IFS and HLS: Detailed Analysis of Inclusion in the A-IFS of the Data Sets for Implication Operations

Comparison of Extended Fuzzy Logic Models of A-IFS and HLS: Detailed Analysis of Inclusion in the A-IFS of the Data Sets for Implication Operations Comparison of Extended uzzy Logic Models of A-IS and HLS: Detailed Analysis of Inclusion in the A-IS of the Data Sets for Implication Operations Xiaoyu HUANG and etsuhisa ODA Aichi Institute of echnology

More information

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,

More information

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

2. The Logic of Compound Statements Summary. Aaron Tan August 2017 2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional

More information

Continuous R-implications

Continuous R-implications Continuous R-implications Balasubramaniam Jayaram 1 Michał Baczyński 2 1. Department of Mathematics, Indian Institute of echnology Madras, Chennai 600 036, India 2. Institute of Mathematics, University

More information

CHAPTER 10. Gentzen Style Proof Systems for Classical Logic

CHAPTER 10. Gentzen Style Proof Systems for Classical Logic CHAPTER 10 Gentzen Style Proof Systems for Classical Logic Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. By humans, not mentioning

More information

Vague and Uncertain Entailment: Some Conceptual Clarifications

Vague and Uncertain Entailment: Some Conceptual Clarifications Conditionals, Counterfactuals, and Causes in Uncertain Environments Düsseldorf, May 2011 Vague and Uncertain Entailment: Some Conceptual Clarifications Chris Fermüller TU Wien, Austria Overview How does

More information

Implications from data with fuzzy attributes vs. scaled binary attributes

Implications from data with fuzzy attributes vs. scaled binary attributes Implications from data with fuzzy attributes vs. scaled binary attributes Radim Bělohlávek, Vilém Vychodil Dept. Computer Science, Palacký University, Tomkova 40, CZ-779 00, Olomouc, Czech Republic Email:

More information

Background for Discrete Mathematics

Background for Discrete Mathematics Background for Discrete Mathematics Huck Bennett Northwestern University These notes give a terse summary of basic notation and definitions related to three topics in discrete mathematics: logic, sets,

More information

Section 2.2 Set Operations. Propositional calculus and set theory are both instances of an algebraic system called a. Boolean Algebra.

Section 2.2 Set Operations. Propositional calculus and set theory are both instances of an algebraic system called a. Boolean Algebra. Section 2.2 Set Operations Propositional calculus and set theory are both instances of an algebraic system called a Boolean Algebra. The operators in set theory are defined in terms of the corresponding

More information

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall CSE 20 HW1 graded review form? HW2 released DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Translate sentences from English to propositional logic using appropriate

More information

Generalized Triangular Fuzzy Numbers In Intuitionistic Fuzzy Environment

Generalized Triangular Fuzzy Numbers In Intuitionistic Fuzzy Environment International Journal of Engineering Research Development e-issn: 2278-067X, p-issn : 2278-800X, www.ijerd.com Volume 5, Issue 1 (November 2012), PP. 08-13 Generalized Triangular Fuzzy Numbers In Intuitionistic

More information

Membership grade mining of mutually inverse fuzzy implication propositions

Membership grade mining of mutually inverse fuzzy implication propositions Granul. Comput. (2017) 2:55 62 DOI 10.1007/s41066-016-0026-1 ORIGINAL PAPER Membership grade mining of mutually inverse fuzzy implication propositions Xunwei Zhou 1 Received: 24 March 2016 / Accepted:

More information

Fuzzy Logic in Narrow Sense with Hedges

Fuzzy Logic in Narrow Sense with Hedges Fuzzy Logic in Narrow Sense with Hedges ABSTRACT Van-Hung Le Faculty of Information Technology Hanoi University of Mining and Geology, Vietnam levanhung@humg.edu.vn arxiv:1608.08033v1 [cs.ai] 29 Aug 2016

More information

Entropy for intuitionistic fuzzy sets

Entropy for intuitionistic fuzzy sets Fuzzy Sets and Systems 118 (2001) 467 477 www.elsevier.com/locate/fss Entropy for intuitionistic fuzzy sets Eulalia Szmidt, Janusz Kacprzyk Systems Research Institute, Polish Academy of Sciences ul. Newelska

More information

Generalized Intuitionistic Fuzzy Ideals Topological Spaces

Generalized Intuitionistic Fuzzy Ideals Topological Spaces merican Journal of Mathematics Statistics 013, 3(1: 1-5 DOI: 10593/jajms013030103 Generalized Intuitionistic Fuzzy Ideals Topological Spaces Salama 1,, S lblowi 1 Egypt, Port Said University, Faculty of

More information

Math Real Analysis

Math Real Analysis 1 / 28 Math 370 - Real Analysis G.Pugh Sep 3 2013 Real Analysis 2 / 28 3 / 28 What is Real Analysis? Wikipedia: Real analysis... has its beginnings in the rigorous formulation of calculus. It is a branch

More information

Level mapping characterizations for quantitative and disjunctive logic programs

Level mapping characterizations for quantitative and disjunctive logic programs Level mapping characterizations for quantitative and disjunctive logic programs Matthias Knorr Bachelor Thesis supervised by Prof. Dr. Steffen Hölldobler under guidance of Dr. Pascal Hitzler Knowledge

More information

CSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!

CSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!! CSCE 222 Discrete Structures for Computing Review for Exam 1 Dr. Hyunyoung Lee 1 Topics Propositional Logic (Sections 1.1, 1.2 and 1.3) Predicate Logic (Sections 1.4 and 1.5) Rules of Inferences and Proofs

More information

CISC-102 Winter 2016 Lecture 17

CISC-102 Winter 2016 Lecture 17 CISC-102 Winter 2016 Lecture 17 Logic and Propositional Calculus Propositional logic was eventually refined using symbolic logic. The 17th/18th century philosopher Gottfried Leibniz (an inventor of calculus)

More information

Topics in Logic and Proofs

Topics in Logic and Proofs Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2

More information

Natural Deduction for Propositional Logic

Natural Deduction for Propositional Logic Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic

More information

Propositional Logic. Fall () Propositional Logic Fall / 30

Propositional Logic. Fall () Propositional Logic Fall / 30 Propositional Logic Fall 2013 () Propositional Logic Fall 2013 1 / 30 1 Introduction Learning Outcomes for this Presentation 2 Definitions Statements Logical connectives Interpretations, contexts,... Logically

More information