离散数学1.1-Propositional logic.pptVIP

fall 2001 Logic and Proofs Logics The discipline that deals with the methods of reasoning. On the elementary level, logic provides rules and techniques for determining whether a given argument valid. Logical reasoning is used in mathematics to prove theorems In computer science to verify the correctness of programs and to prove theorems In the natural and physical sciences to draw conclusions from experiments In the social sciences, and in our everyday lives to solve a multitude of problems. 谁养鱼 ? 8 Queens Problem Discrete Mathematical Structures Propositions（命题） A statement or proposition is a declarative sentence（陈述句） that is either true or false,but not both. true = T (or 1) false = F (or 0) (binary logic) Example ‘the moon is made of green cheese’ ‘go to town!’ X - imperative ‘What time is it?’ X - interrogative Example Which of the following are statements? (a) The earth is round. (b) 2+3=5 (c) Do you speak English? (d) 3-x=5 (e) Take two aspirins. (f) The temperature on the surface of the planet Venus is 800oF. (g) The sun will come out tomorrow. Logical Connectives and Compound Statements (逻辑联结词与复合命题） propositional variables（命题变项）: p,q, r,s, . . . p: The sun is shining today. q: It is cold. Statements or propositional variables can be combined by logical connectives（逻辑联结词） to obtain compound statements(复合命题). p and q: The sun is shining and it is cold. Note The truth value of a compound statement depends only on the truth value of the statement being combined and on the type of connectives being used. Calculus of propositions New Propositions from old: calculus of propositions - relate new propositions to old using TRUTH TABLES(真值表）. Truth table: a table giving the truth values of a compound statement in terms of its component part. Logical Connectives（逻辑联结词） Unary Negation（否定） Binary Conjunction（合取） Disjunction （析取） Exclusive OR （异或） Implication （蕴涵） Biconditional （等价，双条件命题） Negation ‘not’ : ~（否定） Definition:the negation of the statement p is t