03h - Introduction Propositional Logic II Discrete...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 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 Discrete Mathematics Propositional Logic 3-3 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) 1 1 1 1 1 1 1 1 To be or not to be Discrete Mathematics Propositional Logic 3-4 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) 1 1 1 1 Black is white and black is not white Discrete Mathematics Propositional Logic II 3-5 An Example Construct the truth table of the following compound statement p (q p) Discrete Mathematics Propositional Logic II 3-6...
View Full Document

Page1 / 3

03h - Introduction Propositional Logic II Discrete...

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