Professional Documents
Culture Documents
Philo 1 Pointers 2
Philo 1 Pointers 2
Philo 1 Pointers 2
ObvErsIOn
Applicable for all (including A, but there's no A in
"Obversion" :( )
Examples:
1. Contradiction: If one is true, then the other one o A -> E (ex. All books are informative
must be false. -> No books are not informative.)
If one is false, then the other one is true. o E -> A (ex. No umbrellas are paper-
2. Contrary: Both can be false at the same time, but made -> All umbrellas are non-paper
cannot be true. made)
3. Subcontrary: Both can be true at the same time, o I -> O (ex. Some profs are lazy ->
but cannot be false. Some profs are not non-lazy)
4. Subalternation: If the universal is true, then the o O -> I (ex. Some fans are not light ->
existential must also be true. Some fans are non-light).
If the existential is true, we General Form: (Universals)
cannot say anything about the universal. o S -> P
~S -> ~P
If: A is true, E is false General Form: (Particulars)
If: E is true; A is false o S -> P
If: I is true; O is false S -> ~ (~P)
If: O is true; I is false
ContrApOsition
Notice that the values did not come arbitrarily. We Applicable for A and O only
can trace it via the square of oppositions: Examples:
o A-> A (ex. All swivel chairs are soft -> All
A (True) E (False) nonsoft stuff are non- swivel chairs)
su o O-> O (ex. Some rooms are not green
b -> Some non green stuff are not
al nonrooms)
te (Or: Some non green stuff are
contradiction rooms)
I (True)rn O (False) and vice versa. General Form: (A)
o S->P
*(~)P -> (~)S
V. Conversion, Obversion, Contraposition *Depending on how you understand
Conserves truth value of the statement "non"
Rephrases the statement in such a way that either General Form: (O)
o S -> ~P
(~)P -> ~ (~)S Example:
Truth Tables o (P˄R) ↄ Q
~Q
~ - negation (not) R
˅ - disjunction (or) ~P
˄ - conjunction (and)
Ↄ - conditional (if, then) {[(P˄R) ↄ Q] ˄ (~Q) ˄ R} ↄ ~P
≡- biconditional (if and only if)
P R Q ~ ~ P˄ (P˄R [(P˄R)ↄQ {[(P˄R)ↄQ
P Q R )ↄQ ] ^ (~Q) ] ^ (~Q) ^
P ~P ^R R} ↄ ~P
T T T F F T T F T
T F
F T T T F F T F T
F T
T F T F F F T F T
P Q P˄Q
F F T T F F T F T
T T T
T T F F T T F F T
F T F F T F T T F T T T
T F F T F F F T F T F T
F F F F F F T T F T F T
P Q P˅Q Long computation, but this is valid. You may check for
T T T yourself.
F T T
T F T Simpler one:
F F F
P Q PↄQ P ˅ ~R
~R__
T T T ~P
F T T
T F F [(P ˅ ~R) ˄ ~R] ↄ ~P
F F T
P ~R P˅ (P ˅ ~R) ˄ ~P [(P ˅ ~R) ˄ ~R] ↄ
~R ~R ~P
P Q P≡Q T T T T F F
T T T F T T T T T
F T F T F T F F T
T F F F F F F T T
F F T
There is an instance where the end result is false,
I. Creating Truth Tables therefore the argument is invalid.
The purpose of creating truth tables is to
determine validity/ strength of an argument. We II. Falsification
say that an argument is valid if all values On instances when truth tables are too long, we
may opt to use falsification method instead. The
derived from manipulating all possible
rationale behind this is that we assume that the
combination of variables and truth values in an
argument is false and we prove it to be one. If we
argument yields true in all cases. cannot, then the argument is unfalsifiable,
Formula= 2n; where n is the number of variables meaning, it is valid.
Example: Another example:
o (S ↄ T) ˄ (R ↄ U)
S˅R P˅S
T˅U S
~P
{[(S ͻ T)˄(R ↄ U)] ˄ (S˅R)} ↄ ( T˅U)
[(P ˅ S) ^ S] ↄ ~P
First, we assume that this is false. Since the general
form is that of a conditional, we follow the false- FIRST, we assume that it is false:
yielding conditional form T ↄ F
[(P ˅ S) ^ S] ↄ ~P
{[(S ͻ T)˄(R ↄ U)] ˄ (S˅R)} ↄ ( T˅U) T F F
T F F
*Notice that I am aligning values under main We may now derive the value of some variables:
operations for each
[(P ˅ S) ^ S] ↄ ~P
Now, we may operate accordingly: T T F FT
B. Simplification (Simp) 1. (M ˅ O) ↄ N
I˄J 2. P ˄ ~N
I (or J) ~M
3. ~N 2 Simp
8. Conjunction (Conj) 4. ~ (M˅O) 1,3 MT
K 5. ~M ˄ ~O 4 DMT
L 6. ~M 5 Simp
K^L
1. S ↄ T
2. ~S ͻ U
3. ~U
T˅V
4. ~ ~S 2,3 MT
5. S (4 double negation)