MATH 1190 Lecture Notes - Lecture 4: Propositional Variable, Logical Equivalence, Commutative Property
Document Summary
Math 1190 lecture 4 notes- propositional equivalences: example 1, a father tells his two children, a boy and a girl, to play in their backyard without getting dirty. It follows that both children answer yes the second time the question is asked. Because p p is always false, it is a contradiction. Logical equivalences: compound propositions that have the same truth values in all possible cases are called logically equivalent. We can also define this notion as follows: the compound propositions p and q are called logically equivalent if p q is a tautology. Heather will not go to the concert and steve will not go to the concert. Example 9 demonstrates: example 9, determine whether each of the compound propositions (p q) (q r) (r . R) to be true, (p q) (q r) (r p) and (p q r) ( p q .