EECS 1019 Lecture Notes - Fall 2018 Lecture 2 - Truth table, Propositional function, Distributive property
EECS 1019 verified notes
2/9View all
1
EECS 1019 Lecture Notes - Fall 2018 Lecture 1 - Contraposition, Logical biconditional, Sentence (linguistics)
2
EECS 1019 Lecture Notes - Fall 2018 Lecture 2 - Truth table, Propositional function, Distributive property
3
EECS 1019 Lecture Notes - Lecture 3: Modus Tollens, Modus Ponens, Hypothetical Syllogism
Document Summary
Chapter 1: the foundation logic + proof. A tautology is a compound proposition which is always true. A contradiction is a compound proposition which is always false. A contingency is a compound proposition which is neither a tautology nor a contradiction. Propositions p and q are logically equivalent if p q is a tautology. In this caase we write p q (analogy with distributive law) More equivalences (tables 6, 7, 8 page 27, 28 in the textbook) p t p p f p p t t p f f. Check answer with truth table (hint: p q . (p q) ( p q) F p q (p q) p. A compound proposition is satisfiable if it is a tautology or contingency otherwise it is unsatisfiable. F f (p q) (q r) (r q) P(2) is a proposition 4 > 6 false. P(7. 5) is a proposition 9. 5 > 6 true e. g: q(x): x = y where x, y are integers.