Conditional reasoning Flashcards

1
Q

Formal Logic indicators

A

all
none
some
most

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

How do you represent this in a diagram?

All workaholics are happy

A

W —–> H

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

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

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

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

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

Contrapositive of

O/ ——-> P/

is?

A

P ——-> O

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
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. the two variables occur together, or
2. the neither of the two variables occur.

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

How do you represent this in a diagram?

X if and only if Y

A

X <——–> Y

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

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

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

How do you represent this in a diagram?

No X’s are Y’s

A

X <——/—–> Y

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

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

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

How do you represent this in a diagram?

Some X’s are Y’s

A

X some Y

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

How do you represent this in a diagram?

“Some X’s are not Y’s”

A

X some Y/

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

“Some are not”

Can also be defined as?

A

At least one is not
Not all
Possibly all are not
..

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

Most

Can also be defined as?

A

Majority
Possibly all

Usually
Typically
More than half
almost all

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

How do you represent this in a diagram?

Most X’s are Y’s

A

X most Y
—–>

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

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

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

How do you represent this in a diagram?

Not all of the Smallville roads are safe.

A

SR some S/

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

How do you represent this in a diagram?

Most W’s are not Z’s

A

W most Z/
—–>

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

What is the numerical estimate?

All

A

100%

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

What is the numerical estimate?

None

A

0%

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

What is the numerical estimate?

Some

A

1-100 (at least one)

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

What is the numerical estimate?

Some are not

A

0-99 (Not all)

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

What is the numerical estimate?

Most

A

> 50% (majority)

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

What is the numerical estimate?

Most are not

A

< 50% (minority)

30
Q

Reversibility

means?

A

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
Q

T/F ?

A —–> B = B ——> A

A

False

no single arrow is reversible. but we can infer that some B’s are A’s

32
Q

T/F ?

A some B = B some A

A

True

33
Q

List the reversible relationships

A

Double arrow < ——>

Double-not (None) <—-/—–>

some (some)

34
Q

List the non-reversible relationships

A

all ——>

most
—–>

35
Q

T/F ?

A some B/ = B some A/

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

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
Q

Reverse this statement

G some H/

A

H/ some G

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
Q

Reverse this statement

C most D
—–>

A

This statement is irreversible

38
Q

T/F ?

A —–> B <—-/—–> C =
A <—-/—–> C

A

True

This is an additive inference, so-called because it comes from “adding” two statements together to make the inference.

39
Q

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

A

True

This is an inherent inference: inferences that are known to be true simply from the relationship between the two variables.

40
Q

Outline the inherent relationship between

Most, Some, and All

Logic ladder

A

All —> Most —-> Some

Deals only with positive terms

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
Q

T/F ?

if most people like wine , we can infer that all people like whine

A

False

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
Q

T/F ?

“All doctors are lawyers”

we can infer that some lawyers are doctors

A

True

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
Q

What 3 inferences can you draw?

A < ———> P

A
  • Most of A is P
  • Most of P is A
  • A some P

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
Q

Arrange the logic between..

Some are not, none, most are not

A

None —> Most are not —–> Some are not

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
Q

1 rules of formal logic

A

Always combine common terms

A some B, B —-> C =
A some B —–> C

46
Q

T/F ?

Sufficient is not = necessary

A

True

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
Q

3 logical features of conditional statements

A
  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
Q

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.
A

Stem: A —> S

  1. A ——> S ✅ - repeat inference
  2. S ——> A ❌ - Mistaken reversal
  3. A/ —–>S/ ❌ - Mistaken negation
  4. S/ —–>A/ ✅ - Contrapositive of stem

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
Q

To get the contrapositive of a statement …

A

simply reverse and negate the two terms.

49
Q

Contrapositive of

A —–> B

A

B/ ——> A/

50
Q

T/F ?

C —–> D/ =
D —-> C/

A

True

the second is a contrapositive of the first, which states that because D occured, C did not occur.

51
Q

Sufficient indicators

A
  • If
  • When
  • Whenever
  • Every
  • All
  • Any
  • People who …
  • In order to …
  • To get …
  • No
  • None
52
Q

Necessary indicators

A
  • Then
  • Only
  • Only if
  • Must
  • Required
  • Unless
  • Except
  • Until
  • Without
53
Q

Which is the necessary and the Sufficient condition?

Unless a person studies, he or she will not receive an A+.

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
Q

Which is the sufficeint & necerssary?

The park closes when the sun goes down.

The park closes if the sun goes down.

A

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 “whenappears in the second half of a sentence it introduces the sufficient condition — the first part of the stimulus is the necessary condition.

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
Q

Which is the sufficeint & necerssary?

The only way to achieve success is to work hard.

A

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
Q

Which is the sufficeint & necerssary?

No citizen can be denied the right to vote.

A

C —-> DV/

You should convert to am if /then statement

57
Q

When you encounter a stimulus that contains conditional reasoning and
a Must Be True question stem. …

A

look for a contrapositive or a
repeat form in the answer choices.

This may be the correct answer

avoid mistaken reversals or mistaken negation, which are contrapositives of each other.

58
Q

Commom incorrect answer traps in conditional questions

A
  1. Mistaken reversal
  2. Mistaken negation
  3. Exagerated (out of scope)
    4.

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
Q

Either / OR

in the test means?

A

“at least one of the two,
possibly both.”

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
Q

Draw the logic diagram for this

Either John or Jack will attend the party.

A

John——–> Jack/
or
Jack ———> John/

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
Q

Either Cindy or Clarice will attend the party, but not both.

A

Cindy ——-> Clarice/
Clarice —— > Cindy/

Note: both cannot occur together here because the passage clarified this

62
Q

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

A

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

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
Q

Graduate ——–> Smart or
Resourceful

Contrapositive is?

A

Not smart and not resourcefull ———> not graduate

note that as the contrapositive occurred the “or” joining the original necessary conditions changed to “and.”

64
Q

Rich and Famous —–> Happy

Contrapositive is?

A

Not happy —–> not rich or not famous

65
Q

Convert to 3 diagrams ;

Ann will attend if and only if Basil attends.

A
  1. “A if B”
    B ——> A
  2. “A only if B”
    A ——–> B
  3. A <——–> B
66
Q

A <———> B

how many scenarious can be inferred here and what are they?

A
  1. A and B both occur
  2. Neither A nor B occur
    A/ <——-> B/

Remember: double arrow is reversible

In double arrow: Any scenario where one of the two attends occurs but the other does not is impossible.

67
Q

Draw the diagram and its contrapositive of:

Either Jones or Kim will win the election.

A

JW ———> KW/

KW ———-> JW/

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
Q

What should you note about “until

A

“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
Q

T/F?

if A → B and C = B → C.

A

False

if A → B and C, that doesn’t mean that if B → C.

70
Q
A