Lecture3 - Discrete Mathematics Propositional Logic II 3-2...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Introduction Propositional Logic II Discrete Mathematics Andrei Bulatov Discrete Mathematics – Propositional Logic II 3-2 Previous Lecture Statements, primitive and compound Logic connectives: Truth tables s negation ¬ s conjunction s disjunction s exclusive or s implication s biconditional Example `You can access the Internet from campus if you are a computer science major or if you are not a freshman.’ p - `you can access the Internet from campus’ q - `you are a computer science major’ r - `you are a freshman’ Discrete Mathematics – Propositional Logic II 3-3 Discrete Mathematics – Propositional Logic 3-4 Tautologies Tautology is a compound statement (formula) that is true for all combinations of truth values of its propositional variables (p q) (q p) p q (p q) (q p) 0 0 1 0 1 1 1 0 1 1 1 1 “To be or not to be” Discrete Mathematics – Propositional Logic 3-5 Contradictions Contradiction is a compound statement (formula) that is false for all combinations of truth values of its propositional variables (p q) (p ⊕ ¬ q) p q (p q) (p ⊕ ¬ q) 0 0 0 0 1 0 1 0 0 1 1 0 “Black is white and
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 4

Lecture3 - Discrete Mathematics Propositional Logic II 3-2...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online