03.04.2014 Views

Logic Strand Lecture 3

Logic Strand Lecture 3

Logic Strand Lecture 3

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Example:<br />

• Use the “quick” method for the statement<br />

~ ( P ∨ Q)<br />

∧ P to determine if it is a contradiction.<br />

~ (P ∨ Q) ∧ P<br />

Step: 2 1 3*<br />

1.Place “T” under main<br />

connective<br />

T<br />

2. For “T” to occur<br />

under the main<br />

connective, ~ must be<br />

“T” and P must be “T”<br />

T<br />

T<br />

3. For “T” to occur<br />

under ~,<br />

“F”.<br />

P ∨ Q must be<br />

F<br />

4. For “F” to occur<br />

under P ∨ Q, P must be<br />

“F” and Q must be “F”<br />

F<br />

F<br />

P cannot be both “T” and “F”, thus ~ ( P ∨ Q)<br />

∧ P can only<br />

ever be false and is a contradiction.<br />

WUCT121 <strong>Logic</strong> 46

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!