离散数学 Predicates and Quantifiers(期望与量词).pptVIP

the Foundations:Logic and Proof Guo Jian the Foundations:Logic and Proof Guo Jian * the Foundations:Logic and Proof Guo Jian * §1.3 Predicates and Quantifiers Introduction (1) propositional logic cannot adequately express the meaning of statements “Every computer connected to the university network is functioning properly” Can not conclude “MATH3 is functioning properly” “CS is under attack by an intruder” Can not conclude using the rules of propositional logic “There is a computer on the university network that is under attack by an intruder”. predicate logic: predicate, quantifiers * the Foundations:Logic and Proof Guo Jian * 1.predicate (1) Consider the statement “x is greater than 3”. xsubject of the statement “is greater than 3”predicate, property of the subject. (2) P(x) “x is greater than 3” P”greater than 3”(predicate) P(x) is also said to be the value of propositional function P at x. * the Foundations:Logic and Proof Guo Jian * (3) P(x)”x is greater than 3”, propositional function P(4)proposition ,true P(2)proposition, false (3)Example2(p31) A(x)”Computer x is under attack by an intruder.” CS2, MATH1 are under attack. A(CS1)false A(CS2)true A(MATH1)true (4) Statements can involve more than 1 variable. Example 3 (page 31): Q(x,y)”x=y+3” Q(1,2)false Q(3,0)true * the Foundations:Logic and Proof Guo Jian * (5) In general, A statement of the form P(x1,x2,…,xn) is the value of the propositional function P at the n-tuple (x1,x2,…,xn) , and P is called a n-ary predicate. (6)Predicates are used in the verification that computer programs produce the desired output when given valid input. Preconditionvalid input Postconditionthe conditions that output should satisfy. * the Foundations:Logic and Proof Guo Jian * (7) quantifiers(量词)a range of elements universal quantifiers(全称量词) existential quantifiers(存在