Chapter02_slides_Lesson02.pdf

1Introduction to Logic Michael Genesereth and Eric Kao Stanford University Propositional Logic 2Talking Head Talking Head 3Propositional Logic Syntax Simple Sentences express simple facts about the world Compound sentences express logical relationships among simpler sentences of which composed Propositional Sentences 4In Propositional Logic, simple sentences take the form of atomic symbols, called proposition constants. By convention (in this course), proposition constants are written as strings of letters, digits, and the special character _. Examples: Non-Examples: raining 324567 r32aining raining-or-snowing rAiNiNg raining_or_snowing Simple Sentences Compound Sentences I Negations: (?p) The argument of a negation is called the target. Conjunctions: (p ∧ q) The arguments of a conjunction are called conjuncts. Disjunctions: (p ∨ q) The arguments of a disjunction are called disjuncts. 5Compound Sentences II Implications: (p ? q) The left argument of an implication is the antecedent. The right argument is the consequent. Equivalences / Biconditionals: (p ? q) Nesting Note that compound sentences can be nested inside of other compound sentences. ((p ∧ q) ∧ r) ((p ∨ q) ∨ r) (((p ∧ q) ∧ r) ? ((p ∨ q) ∨ r)) 6Parentheses Parentheses are messy and sometimes unnecessary. (((p ∧ q) ∨ r) ? ((p ∨ q) ∧ r)) Dropping Parentheses makes things simpler. (p ∧ q) becomes p ∧ q But it can lead to ambiguities. ((p ∧ q) ∨ r) becomes p ∧ q ∨ r (p ∧ (q ∨ r)) becomes p ∧ q ∨ r Precedence Parentheses can be dropped when the structure of an expression can be determined by precedence. ? ∧ ∨ ? ? 7Using Precedence An operand surrounded by two operators associates with the operator of higher precedence. If surrounded by operators of equal precedence, the operand associates with the operator to the right. p ∧ q ∨ r → ((p ∧ q) ∨ r) p ∨ q ∧ r → (p ∨ (q ∧ r)) p ? q ? r → (p ? (q ? r)) p ? q ? r → (p ? (q ? r)) ?p ∧ q → ((?p) ∧ q) Propositional Languages A propositio