Logic & Critical Thinking Flashcards
Equivalent quanitified statements
All A are B -> Some A are not B
Some A are B -> No A are B
Conjunction
"p ^ q" p and q p but q p yet q p nevertheless q
Disjunction
The compound statement formed by connecting statements with the word ‘or’
“p v q”
Conditional Statement
The compound statement “If p, then q ”
is symbolized by p -> q
antecedent -> consequent
If p then q. q if p. p is sufficient for q. q is necessary for p. p only if q only if q,p.
Biconditional Statement
the compound statement
“p if and only if q” is symbolized by p q
p if and only if q q if and only if p If p then q, and if q then p. p is necessary and sufficient for q. q is necessary and sufficient for p.
Dominance of connectives
Biconditional
Conditional
Conjunction/Disjunction
Negation
Conjunction ^ (truth table)
Only true when both simple statements true (T T)
Disjunction v (truth table)
False only when both components are false (F F).
Conditional -> (truth table)
Only false when antecedent is true and consequent is false (T F)
Biconditional (truth table)
True only when components have the same truth value (T T)(F F)
Contrapositive of conditional
Both values negatted and switched. Equivalent to conditional statement
Converse of conditional
Values switched. Not equivalent.
Inverse of conditional
Negatting both values. Not Equivalent.
Negation of conditional
~(p -> q) = p ^ ~q
De Morgan’s Law
~(p ^ q) = ~p v ~q
~(p v q) = ~p ^ ~q
Arguments
An argument consists of two parts: the given statements, called the premises, and a conclusion.
An argument is valid if the conclusion is true whenever the premises are assumed to be true.
Fallacy
An argument that is not valid is said to be an invalid argument
Tautology
All statements are true.
TESTING THE VALIDITY OF AN ARGUMENT WITH A TRUTH TABLE
- Use a letter to represent each simple statement in the argument.
- Express the premises and the conclusion symbolically. (direct reasoning form)
- Write a symbolic conditional statement of the form
3 (premise 1) ^ (premise 2) ^ (premise n) -> conclusion,
where n is the number of premises. - Construct a truth table for the conditional statement in step 3.
- If the final column of the truth table has all trues, the conditional statement is a tautology and the argument is valid. If the final column does not have all trues, the conditional statement is not a tautology and the argument is invalid.
Fallacy of the inverse (invalid argument)
p -> q
~p
_______
∴ ~q
Contrapositive reasoning (valid argument)
p -> q
~q
_______
∴ ~p
Disjunctive Reasoning (valid argument)
p v q
~q
_______
∴ p
p v q
~p
_______
∴ q
Transitive Reasoning
p -> q q -> r \_\_\_\_\_\_\_ ∴ p -> r ∴ ~r -> ~p