Handout in Logic (MBDN) I. Symbols: A.

NEGATION
not P P is not T It is not the case that P P is not the case P is false

~P

B. CONJUNCTION
P and Q P but Q P although Q Both P and Q P moreover Q

P.Q
P nevertheless Q P however Q P yet Q P while Q

C. ALTERNATION/ DISJUNCTION
P or Q P unless Q Either P or Q Unless Q, P

PvQ

D. NEGATIVE DISJUNCTION
Neither P nor Q both not not either P or Q

~ (P v Q)

E. NEGATIVE CONJUNCTION
not both

~(P . Q)

F. CONDITIONAL
If P then Q In case P, Q If P, Q P implies Q P only if Q

PQ
Q if P Q is necessary for P P is sufficient for Q Q, provided that P

G. BICONDITIONAL
P is equivalent to Q P if and only if Q P if Q, and Q if P
1

P Q

II. Truth Tables CONJUNCTION P True True False False DISJUNCTION P True True False False CONDITIONAL P True True False False BICONDITIONAL P True True False False Q True False True False P Q True False True True Q True False True False P v Q True True True False Q True False True False P . Q True False False False

Q True False True False

P True False False True

**** SIMPLER TECHNIQUE TO MEMORIZE

Conjunction TTT, the rest false Disjunction FFF, the rest T Conditional TFF, the rest T Biconditional same truth values T; different truth values F

III. CHECKING VALIDITY OF ARGUMENTS USING THE TRUTH TABLE METHOD Steps to follow: 1. Represent the argument 2. Count the number of propositional variables or the number of simple statements in the argument. (Count the number of letters in the symbolized argument. Each letter should only be counted once). 3. Formula: 2n ---------------- # of propositional variables
__________

2 4. Create a truth table for the argument. Write the propositional variables in one horizontal line . The variable that first appeared in the symbolized argument should be written first, followed by the second, the third et cet. The result in step 3 will determine the number of Trues under the first propositional variable. Divide this by 2 and the result will be the # of Trues under the 2nd propositional variable. From left to right, always divide the result by 2 to find out the # of trues under a particular variable until you reach the last variable. Under a particular variable, the # of trues will determine how many times false should be written. The combination of T and F from the 2nd to the last variable has to be repeated until they equal the length of the first variable. Beside the enumerated variables, write the symbolized premise/s and conclusion of the argument. Complete the T values of the premises and conclusion based on the assigned truth values of variables. 5. After completing the table, look for substitution instances where all the premises are T and the conclusion is false. If there is such case, the argument is INVALID. Absence of that case implies that the argument is VALID. (Concrete illustration/examples will be given during the lecture) REFERENCES:
Acua, Andresito Philosophical Analysis. Bittle. Science of Correct Thinking. Copi, Irving. Introduction to Logic. Magat, Dan Reynald. A First Book in Logic