109_sp2011_ho_truth_sol

109_sp2011_ho_truth_sol - 109 Spring 2011 - Truth Tables -...

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

View Full Document Right Arrow Icon
109 Spring 2011 - Truth Tables - Solutions Exercise (I.2) . By using truth tables prove that, for all statements P and Q , the three statements (1) ‘ P = Q (2) ‘( P or Q ) ⇐⇒ Q (3) ‘( P and Q ) ⇐⇒ P are equivalent. Recall that ⇐⇒ is deFned by the truth table P Q P ⇐⇒ Q T T T T ± ± ± T ± ± ± T Therefore, we have: P Q P = Q P or Q P and Q ( P or Q ) ⇐⇒ Q ( P and Q ) ⇐⇒ P T T T T T T T T ± ± T ± ± ± ± T T T ± T T ± ± T ± ± T T Since the third, sixth, and seventh columns of the truth-table are identical the three state- ments are equivalent.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Exercise (I.3) . Prove that the three basic connectives ‘or’, ‘and’, and ‘not’ can all be written in terms of a single connective ‘notand’ where ‘
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/02/2011 for the course MATH 109 taught by Professor Knutson during the Spring '06 term at UCSD.

Page1 / 2

109_sp2011_ho_truth_sol - 109 Spring 2011 - Truth Tables -...

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