- PowerScore Staff
- Posts: 5972
- Joined: Mar 25, 2011
- Fri Jun 01, 2012 11:13 am
#87489
Setup and Rule Diagram Explanation
This is a Grouping: Undefined game.
The game scenario establishes that a group of parents are selected from seven volunteers. The game does not establish exactly how many volunteers are in the group, and so this game is Undefined. Games of this nature appear frequently on the LSAT, and thus the lack of definition should not trouble you.
The first four rules establish simple conditional relationships, although the third and fourth rules are tricky because they hinge on a negative sufficient condition.
This rule contains a sufficient condition that is negative. Thus, when S does not volunteer, V must volunteer. Via the contrapositive, when V does not volunteer, S must volunteer. Thus, when one of S or V does not volunteer, the other must volunteer (it is also possible for both to volunteer). Consequently, because either S or V, or both, must always volunteer, we can reserve a space in the volunteer group for at least one of S or V with an S/V dual-option.
An alternate representation for this rule is:
This representation captures the entire meaning of the rule, namely that both S and V cannot be absent from the group.
This rule also contains a sufficient condition that is negative, and works in the same manner as the prior rule. Thus, when R does not volunteer, L must volunteer. Via the contrapositive, when L does not volunteer, R must volunteer. Thus, either R or L, or both, must always volunteer.
An alternate representation for this rule is:
Consequently, because either R or L, or both, must always volunteer, we can reserve a space in the volunteer group for at least one of R or L with an R/L dual-option.
The representations above are only for each individual rule, and do not address any inferences. Let’s now look at the inferences that follow from the rules.
Power Chain Inference: The rules combine in such a way that a long chain is created:
This tremendously long and powerful chain is made by combining, in order, the contrapositive of the fourth rule, the first rule, the second rule, the fifth rule, and the contrapositive of the third rule. Having every rule connect in one long chain is exceedingly rare. Some students look at this inference and assume it only operates if L does not volunteer. But, the rules of conditional relationships indicate that any segment of the chain is valid. Thus, for example, if R volunteers then the remainder of the chain must occur (M volunteers, then T volunteers, etc.). A contrapositive of any portion is also valid.
Note also because this chain begins with a negative sufficient condition, a number of inferences can be made regarding the relationship of L and other variables. For example, if L is not selected then T must be selected, and via the contrapositive if T is not selected then L must be selected. Thus, at least one of either L or T must always volunteer. Other inferences can also be made in the same vein, as will be discussed in question #12.
The chain also reveals that, via the contrapositive, if either F or V volunteers, then L must volunteer:
However, because this inference is a contrapositive of an inference contained in the chain, we will not write it out separately. In fact there are a number of similar inferences, but because they are all contained within the chain, we will not write them out separately. You should be comfortable enough with chain conditional reasoning and contrapositives that you should not have to write each of them out individually. Once the chain is written out, they are all present.
Adding the information above leads to the final setup for the game:
This is a Grouping: Undefined game.
The game scenario establishes that a group of parents are selected from seven volunteers. The game does not establish exactly how many volunteers are in the group, and so this game is Undefined. Games of this nature appear frequently on the LSAT, and thus the lack of definition should not trouble you.
The first four rules establish simple conditional relationships, although the third and fourth rules are tricky because they hinge on a negative sufficient condition.
This rule contains a sufficient condition that is negative. Thus, when S does not volunteer, V must volunteer. Via the contrapositive, when V does not volunteer, S must volunteer. Thus, when one of S or V does not volunteer, the other must volunteer (it is also possible for both to volunteer). Consequently, because either S or V, or both, must always volunteer, we can reserve a space in the volunteer group for at least one of S or V with an S/V dual-option.
An alternate representation for this rule is:
This representation captures the entire meaning of the rule, namely that both S and V cannot be absent from the group.
This rule also contains a sufficient condition that is negative, and works in the same manner as the prior rule. Thus, when R does not volunteer, L must volunteer. Via the contrapositive, when L does not volunteer, R must volunteer. Thus, either R or L, or both, must always volunteer.
An alternate representation for this rule is:
Consequently, because either R or L, or both, must always volunteer, we can reserve a space in the volunteer group for at least one of R or L with an R/L dual-option.
The representations above are only for each individual rule, and do not address any inferences. Let’s now look at the inferences that follow from the rules.
Power Chain Inference: The rules combine in such a way that a long chain is created:
This tremendously long and powerful chain is made by combining, in order, the contrapositive of the fourth rule, the first rule, the second rule, the fifth rule, and the contrapositive of the third rule. Having every rule connect in one long chain is exceedingly rare. Some students look at this inference and assume it only operates if L does not volunteer. But, the rules of conditional relationships indicate that any segment of the chain is valid. Thus, for example, if R volunteers then the remainder of the chain must occur (M volunteers, then T volunteers, etc.). A contrapositive of any portion is also valid.
Note also because this chain begins with a negative sufficient condition, a number of inferences can be made regarding the relationship of L and other variables. For example, if L is not selected then T must be selected, and via the contrapositive if T is not selected then L must be selected. Thus, at least one of either L or T must always volunteer. Other inferences can also be made in the same vein, as will be discussed in question #12.
The chain also reveals that, via the contrapositive, if either F or V volunteers, then L must volunteer:
However, because this inference is a contrapositive of an inference contained in the chain, we will not write it out separately. In fact there are a number of similar inferences, but because they are all contained within the chain, we will not write them out separately. You should be comfortable enough with chain conditional reasoning and contrapositives that you should not have to write each of them out individually. Once the chain is written out, they are all present.
Adding the information above leads to the final setup for the game:
You do not have the required permissions to view the files attached to this post.
Dave Killoran
PowerScore Test Preparation
Follow me on X/Twitter at http://twitter.com/DaveKilloran
My LSAT Articles: http://blog.powerscore.com/lsat/author/dave-killoran
PowerScore Podcast: http://www.powerscore.com/lsat/podcast/
PowerScore Test Preparation
Follow me on X/Twitter at http://twitter.com/DaveKilloran
My LSAT Articles: http://blog.powerscore.com/lsat/author/dave-killoran
PowerScore Podcast: http://www.powerscore.com/lsat/podcast/