Conditional reasoning Flashcards
1
Q
Formal Logic indicators
A
all
none
some
most
2
Q
How do you represent this in a diagram?
All workaholics are happy
A
W —–> H
3
Q
How do you represent this in a diagram?
All workaholics are unhappy
A
W ——> H/ (H is negated)
use those same letters to represent the group throughout your diagram and inferences.
For example,
if you represent “happy” with “H” as you
begin your diagram, and later you are presented with a seemingly new element, “unhappy,”** do not create a new variable, “UH**.” Instead, simple negate “happy” and use “H” .
4
Q
When do you use this single arrow?
——->
A
Introduced by sufficient and necessary words such as:
if…then
when
all
every
only,
where both elements are positive or both elements are negative.
5
Q
How do you represent this in a diagram?
All X’s are Y’s
A
(X and Y both positive)
Diagram: X—–> Y
6
Q
How do you represent this in a diagram?
If you are not T, then you are not V
A
(T and V both negative)
Diagram: T/ ——-> V/
7
Q
Contrapositive of
O/ ——-> P/
is?
A
P ——-> O
8
Q
When do you use this double arrow?
<———–>
A
When conditions are Introduced by;
- if and only if
- vice versa
- repeating and reversing the terms (as in “If A attends then B attends, and if B attends then A attends”).
- or by any other situations where the author implies that the arrow goes “both ways .
Double-arrow statements allow for only two possible outcomes:
1. both occur
or
2. neither occur
9
Q
How do you represent this in a diagram?
X if and only if Y
A
X <——–> Y
10
Q
How do you represent this in a diagram?
All W’s are Z’s, and all Z’s are W’s
A
W <——> Z
11
Q
When do you use this double-not arrow?
<——-/——–>
A
Introduced by conditional statements where exactly one of the terms is negative
or
by statements using words such as “no” and “none” that imply the two variables cannot “go
together.”
12
Q
How do you represent this in a diagram?
No X’s are Y’s
A
x –> Y/
X <——/—–> Y
13
Q
How do you represent this in a diagram?
If you are a T, then you are not a V
A
T ———> V/
or
T <—–/—-> V
14
Q
Some
Can also be defined as?
A
At least one
Possibly all
at least some
a few
a number
several
part of
a portion
15
Q
How do you represent this in a diagram?
Some X’s are Y’s
A
X some Y
16
Q
How do you represent this in a diagram?
“Some X’s are not Y’s”
A
X some Y/
17
Q
“Some are not”
Can also be defined as?
A
At least one is not…
Not all …
Possibly all are not…
..
18
Q
Most
Can also be defined as?
A
Majority
Possibly all
Usually
Typically
More than half
almost all
19
Q
How do you represent this in a diagram?
Most X’s are Y’s
A
X most Y
—–>
20
Q
Most are not
Can also be defined as?
A
Majority are not..
Possibly all are not..
more than half are not
almost all are not
usually not
typically not
21
Q
T/F?
“Some” & “Most” statements have contrapositive
A
False
Only the arrow statements like “all” have contrapositives; some and most do not because they do not necessarily encompass an entire group.
22
Q
How do you represent this in a diagram?
Not all of the Smallville roads are safe.
A
SR some S/
23
Q
How do you represent this in a diagram?
Most W’s are not Z’s
A
W most Z/
—–>
24
Q
What is the numerical estimate?
All
A
100%
25
# What is the numerical estimate?
None
0%
26
# What is the numerical estimate?
Some
1-100 (at least one)
27
# What is the numerical estimate?
Some are not
0-99 (Not all)
28
# What is the numerical estimate?
Most
> 50% (majority)
29
# What is the numerical estimate?
Most are not
< 50% (minority)
30
Reversibility
| means?
means that the relationship between the two variables has exactly the same meaning regardless of which “side” of the relationship is the starting point of your analysis.
31
# T/F ?
A -----> B **=** B ------> A
**False**
## Footnote
no single arrow is reversible. but we can infer that some B's are A's
32
# T/F ?
A some B = B some A
True
33
List the reversible relationships
Double arrow < ------>
Double-not (None) <----/----->
some (some)
34
List the non-reversible relationships
all ------>
most
----->
35
# T/F ?
A some B/ = B some A/
**False**
we know that some A’s are not B’s.
Correctly reversed, the relationship reads, “Some things that are not B are A’s.”
B/ some A ✅
| Key: "Some" do not have contrapositive, but they are reversible
## Footnote
Thus, you can reverse a some are not statement, but you must be careful when doing so in order to avoid
accidentally moving the “not.”
36
# Reverse this statement
G some H/
H/ some G
## Footnote
Thus, you can reverse a some are not statement, but you must be careful when doing so in order to avoid
accidentally moving the “not.”
37
# Reverse this statement
C most D
----->
This statement is irreversible
38
# T/F ?
A -----> B <----/-----> C/ =
A <----/-----> C/
**True**
## Footnote
This is an additive inference, so-called because it comes from “adding” two statements together to make the inference.
39
# T/F ?
A --------> B ,
It must be true that....
* Most A's are B's
* Some A's are B's
* Some B's are A's
**True**
## Footnote
This is an inherent inference: inferences that are known to be true simply from the relationship between the two variables.
40
# Outline the inherent relationship between
Most, Some, and All
| Logic ladder
All ---> Most ----> Some
| Deals only with positive terms
## Footnote
if you have an all relationship, you automatically know that the most and some relationships for that same statement are true.
So, if a statement is made that “All waiters
like wine,” then you immediately know that “Most waiters like wine,” and “Some waiters like wine.”
If “Most waiters like wine,” then you
automatically know that “Some waiters like wine.”
41
# T/F ?
if most people like wine , we can infer that all people like whine
**False**
## Footnote
But, because "most" is below "all" on the Logic Ladder, you do not know with certainty that “All waiters like wine” (it is possibly true, but not known for certain).
This reveals a truth about the Logic Ladder: the upper rungs automatically imply the lower rungs, but the
lower rungs do not automatically imply the upper rungs. In other words, as you go down the rungs the
lower relationships must be true, but as you go up the rungs the higher relationships might be true but are not certain.
42
# T/F ?
“All doctors are lawyers"
we can infer that some lawyers are doctors
**True**
## Footnote
from the Logic Ladder we know that “Some
doctors are lawyers.” And, because some is a reversible term, we then know that “Some lawyers are doctors.”
The presence of inherent inferences in non-reversible terms such as all and most helps to make
complex inferences easier to follow.
43
# What 3 inferences can you draw in terms of most & some quantity ?
A < ---------> P
* Most of A is P
* Most of P is A
* A some P
## Footnote
This is a very tricky problem. Because the arrow between AFR and RP goes in both directions,
we can infer that the most relationships are inherent in both directions.
44
# Arrange the logic between..
Some are not, none, most are not
None ---> Most are not -----> Some are not
## Footnote
This is the logic ladder for negative terms
So, if a statement is made that “None of the waiters like wine,” then you immediately know that “Most waiters do not like wine,” and “Some waiters do not like wine.”
just as in the positive Logic Ladder, in the negative
Logic Ladder the upper rungs automatically imply the lower rungs, but the lower rungs do not
automatically imply the upper rungs.
45
1 rules of formal logic
**Always combine common terms**
*A some B, B ----> C =
A some B -----> C*
46
# T/F ?
Sufficient **is not =** necessary
True
## Footnote
if a sufficient condition occurs,
you automatically know that the necessary condition also occurs.
If a necessary condition occurs, then it is possible but not certain that the sufficient
condition will occur.
47
3 logical features of conditional statements
1. the sufficient condition does not actively cause the necessary condition to happen. Instead, the occurrence of the sufficient condition is a sign or indicator that the necessary condition will occur, is occurring,
or has already occurred. In
2. Temporally speaking, either condition can occur first, or the two conditions can occur at the same time.
3. The conditional relationship stated by the author does not have to reflect reality. Your job is not to figure out what sounds reasonable, but rather to perfectly capture the meaning of the author’s sentence.
47
# Which of the following options are valid or invalid?
If someone gets an A+ on a test, then they must have studied for the
test.
1. John received an A+ on the test, so he must have studied for the test.
2. John studied for the test, so he must have received an A+ on the test.
3. John did not receive an A+ on the test, so he must not have studied on the test.
4. John did not study for the test, so he must not have received an A+ on the test.
Stem: A ---> S
1. A ------> S ✅ - repeat inference
2. S ------> A ❌ - Mistaken reversal
3. A/ ----->S/ ❌ - Mistaken negation
4. S/ ----->A/ ✅ - Contrapositive of stem
## Footnote
Remember A ---->S is not reversible
But for A ----S > we can derive a contrapositive, which states that when the necessary condition fails to
occur, then the sufficient condition cannot occur.
48
To get the contrapositive of a statement ...
simply reverse and negate the two terms.
49
# Contrapositive of
A -----> B
B/ ------> A/
50
# T/F ?
C -----> D/ =
D ----> C/
**True**
## Footnote
the second is a contrapositive of the first, which states that because D occured, C did not occur.
51
Sufficient indicators
* If
* When
* Whenever
* Every
* All
* Any
* People who ...
* In order to ...
* To get ...
* No
* None
52
Necessary indicators
* Then
* Only
* Only if
* Must
* Required
* Unless
* Except
* Until
* Without
53
# Which is the necessary and the Sufficient condition?
Unless a person studies, he or she will not receive an A+.
**Unless Equation** is applied to the diagram:
1. Whatever term is modified by “**unless**,” “**except**,” “**until**,” or “**without**”
**becomes the necessary condition**.
2. The **remaining term** is **negated** and **becomes the sufficient** condition.
Since “unless” modifies “a person studies,” “Study” becomes the necessary
condition. The remainder, “he or she will not receive an A+,” is negated by
dropping the “not” and becomes “he or she will receive an A+.” Thus, the sufficient condition is “A+,” and the diagram is as follows:
**A+ -------> S**
54
# Which is the sufficeint & necerssary?
The park closes when the sun goes down.
The park closes if the sun goes down.
S -----> PC
The term “**when**” typically introduces a **sufficient condition**, and so “sun goes down” is the sufficient condition.
where a word such as “**if**” or “**when**” **appears in the second half of a sentence** it **introduces the sufficient condition** — the first part of the stimulus is the **necessary condition**.
## Footnote
The fastest approach is a mechanistic one:
observe the form of the problem by identifying the indicators (like “when”), then diagram the
problem using those as your guides.
Only resort to weighing the merits of each condition if no indicators are present to assist you.
In this way you can avoid over-thinking a problem and introducing errors into the system.
55
# Which is the sufficeint & necerssary?
The only way to achieve success is to work hard.
This is another tricky problem.
As usual, “**only**” introduces the **necessary** condition, but the test
makers use a deceptive device: in this sentence “only” modifies “way,” and the “only way” refers to working hard.
Thus, “work hard” is in fact the necessary condition.
**This type of construction appears with enough frequency that you should be familiar with it**
56
# Which is the sufficeint & necerssary?
No citizen can be denied the right to vote.
C ----> DV/
## Footnote
You should convert to am if /then statement
57
When you encounter a stimulus that contains conditional reasoning and
a Must Be True question stem. ...
look for a contrapositive or a
repeat form in the answer choices.
This may be the correct answer
## Footnote
avoid mistaken reversals or mistaken negation, which are contrapositives of each other.
58
Commom incorrect answer traps in conditional questions
1. Mistaken reversal
2. Mistaken negation
3. Exagerated (out of scope)
4.
## Footnote
When considering the likelihood that one of two
possible answers will appear, you can expect that
the test makers will typically choose the answer that
requires the most work to reach the correct answer.
59
Either / OR
| in the test means?
“at least one of the two,
possibly both.”
## Footnote
In its everyday use outside of the LSAT, “either/
or” has come to mean “one or the other, but not both,” but this usage is incorrect on the LSAT.
60
# Draw the logic diagram for this
Either John or Jack will attend the party.
John--------> Jack/
or
Jack ---------> John/
## Footnote
Note: second diagram is the contrapositive of the first diagram
The diagrams reflect the fact that if one of the two fails to attend, then the other must attend in order to satisfy the “at least one of the two” condition imposed by the “either/or” term.
Note that neither of these two diagrams preclude both John and Jack from attending the party. Meaning it is possible that both also attend.
61
Either Cindy or Clarice will attend the party, but not both.
Cindy -------> Clarice/
Clarice ------ > Cindy/
cindy <--/-->clarice/
## Footnote
Note: both cannot occur together here because the passage clarified this
62
# Contrapositive T/F ?
To graduate from Throckmorton College you must be both smart and
resourceful.
Graduate -------> Smart and Resourceful =
Not Smart and not resourceful --> Not graduate
**False**
Not smart **or** Not resourceful -------> Not graduate
*In this case, if either one of the two necessary conditions is not met, then you cannot graduate*
## Footnote
Whenever you take a contrapositive of a statement
with multiple terms in the sufficient or necessary
condition, “and” turns into “or,” and “or” turns into “and.”
63
Graduate --------> Smart or
Resourceful
| Contrapositive is?
Not smart **and** not resourcefull ---------> not graduate
## Footnote
note that as the contrapositive occurred the “or” joining the original necessary conditions changed to “and.”
64
Rich and Famous -----> Happy
| Contrapositive is?
Not happy -----> not rich or not famous
65
# Convert to 3 diagrams ;
Ann will attend if and only if Basil attends.
1. “A if B”
B ------> A
2. “A only if B”
A --------> B
3. A <--------> B
66
A <---------> B
| how many scenarious can be inferred here and what are they?
1. A and B both occur
2. Neither A nor B occur
A/ <-------> B/
| Remember: double arrow is reversible
## Footnote
In double arrow: Any scenario where one of the two attends occurs but the other does not is impossible.
67
# Draw the diagram and its contrapositive of:
Either Jones or Kim will win the election.
JW ---------> KW/
KW ----------> JW/
## Footnote
Depending on the type of election, there may or may not be only one “winner” of the election.
Look for CLUES in the passage to determine if there is a posibility of both occuring
68
What should you note about "**until**"
"Until" is the time condition of "unless."
Because "until" indicates a time condition (before/after), there cannot be a simultaneous occurrence between the necessary and sufficient condition.
69
# T/F?
if A → B & C
Therefore; B → C.
**False**
if A → B and C, that doesn’t mean that if B → C.
70
# what can/cannot be inferred from this?
Either A & B or C will win. However both cannot win together.
* A &B → C/
* C → A/ or B/
Because both cannot occur together, we use the ←/→ that indicates that 2 items cannot occur together i.e. when one is +ve(occurs), the other is -ve (cannot occur).
We also know the ←/→ is reversible
Therefore;
* A&B ←/→ C
Inferrences;
* if A and B occured, then C must not occur
* if C did not occur, then A and B must occur
* if C occured, then A/ occured or B/ occured. ie atleast one out of the 2 occured, possibly both.
* If A/ , C occured
* If B/ , C occured
71
# Which of the following inferences is valid /invalid and why?
A&B ←/→ C/
From above we can inferr that;
A. if C happened, then A did not happen
B. If C happened, then B did not happen
C. If A happened, then C happened
D. If B happened, then C happened
E. If A did not happen, then C happened
F. If B did not happen, then C happened
G. If C happened, then both did not happen
H. If C happened, then Either A or B did not happen, possibly both did not happen
Firstly contrapositive - C ←/→ A/ or B/
A. if C happened, then A did not happen ❌
Reason: The necessary condition is not dependednt only on absence of A alone.
It is possible that B was absent instead while A was present. The correct answer should have been "either A was absent or B was Absent. In other words, atleast one of the two (A or B) was absent"
B. If C happened, then B did not happen ❌
Reason: same as A
C. If A happened, then C happened
❌
Reason: Mistaken negation
D. If B happened, then C happened
❌
Reason: Mistaken negation
E. If A did not happen, then C happened
✅
Reason: we need at least one not to happen as a necessary condition for C to occur
F. If B did not happen, then C happened
✅
Reason: we need at least one not to happen as a necessary condition for C to occur
G. If C happened, then both did not happen ❌
Reason: either or means at least one, possibly both
H. If C happened, then Either A or B did not happen, possibly both did not happen
✅
Reason- A paraphrase of the exact contrapositive.
