Logic & Critical Thinking Flashcards

1
Q

Equivalent quanitified statements

A

All A are B -> Some A are not B

Some A are B -> No A are B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Conjunction

A
"p ^ q"
p and q
p but q
p yet q
p nevertheless q
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Disjunction

A

The compound statement formed by connecting statements with the word ‘or’
“p v q”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Conditional Statement

A

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.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Biconditional Statement

A

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.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Dominance of connectives

A

Biconditional
Conditional
Conjunction/Disjunction
Negation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Conjunction ^ (truth table)

A

Only true when both simple statements true (T T)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Disjunction v (truth table)

A

False only when both components are false (F F).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Conditional -> (truth table)

A

Only false when antecedent is true and consequent is false (T F)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Biconditional (truth table)

A

True only when components have the same truth value (T T)(F F)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Contrapositive of conditional

A

Both values negatted and switched. Equivalent to conditional statement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Converse of conditional

A

Values switched. Not equivalent.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Inverse of conditional

A

Negatting both values. Not Equivalent.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Negation of conditional

A

~(p -> q) = p ^ ~q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

De Morgan’s Law

A

~(p ^ q) = ~p v ~q

~(p v q) = ~p ^ ~q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Arguments

A

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.

17
Q

Fallacy

A

An argument that is not valid is said to be an invalid argument

18
Q

Tautology

A

All statements are true.

19
Q

TESTING THE VALIDITY OF AN ARGUMENT WITH A TRUTH TABLE

A
  1. Use a letter to represent each simple statement in the argument.
  2. Express the premises and the conclusion symbolically. (direct reasoning form)
  3. Write a symbolic conditional statement of the form
    3 (premise 1) ^ (premise 2) ^ (premise n) -> conclusion,
    where n is the number of premises.
  4. Construct a truth table for the conditional statement in step 3.
  5. 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.
20
Q

Fallacy of the inverse (invalid argument)

A

p -> q
~p
_______
∴ ~q

21
Q

Contrapositive reasoning (valid argument)

A

p -> q
~q
_______
∴ ~p

22
Q

Disjunctive Reasoning (valid argument)

A

p v q
~q
_______
∴ p

p v q
~p
_______
∴ q

23
Q

Transitive Reasoning

A
p -> q
q -> r
\_\_\_\_\_\_\_
∴ p -> r
∴ ~r -> ~p