LSAT and Law School Admissions Forum

Get expert LSAT preparation and law school admissions advice from PowerScore Test Preparation.

 megmeg123
  • Posts: 4
  • Joined: May 26, 2016
|
#25625
It seems like the most "important" inference we can draw from the F :arrow: C :dblline: D relationship is that F :dblline: D, however, in the explanation of this drill, I'm told that another inference (that's not important for LG, but for LR) is that some Gs are not Cs, couldn't I also make the inference that some Gs are not Fs? Just curious :)

Thanks for your help!
 Nikki Siclunov
PowerScore Staff
  • PowerScore Staff
  • Posts: 1362
  • Joined: Aug 02, 2011
|
#25659
Hi megmeg123,

Yes, that's also an inference you can make.. just don't expect it to be terribly useful in LG.

Here's how I would link up the conditional statements in this drill:

  • F :arrow: C :dblline: D :arrow: G
The following can be inferred:

  • F :dblline: D
    G :some: NOT C
    G :some: NOT F
Good job on this one! :-)
 megmeg123
  • Posts: 4
  • Joined: May 26, 2016
|
#25722
Nikki Siclunov wrote:Hi megmeg123,

Yes, that's also an inference you can make.. just don't expect it to be terribly useful in LG.

Here's how I would link up the conditional statements in this drill:
  • F :arrow: C :dblline: D :arrow: G
The following can be inferred:
  • F :dblline: D
    G :some: NOT C
    G :some: NOT F
Good job on this one! :-)
Thanks for all your help!
User avatar
 Dave Killoran
PowerScore Staff
  • PowerScore Staff
  • Posts: 5972
  • Joined: Mar 25, 2011
|
#29569
Here's how the two "some are not" inferences discussed in the book are made:

First, for the G to C inference, start with the chain relationship:

  • C :dblline: D :arrow: G

    From G, we can ride "backwards" over the arrow (which is a "some" relationship going that direction) to D. From D, we can ride to C, and there's a negative there. The lowest strength term along the chain is "some," and so the inference is G :some: C.

Second, for the G to F inference, reuse the F :dblline: D inference, and add G to the chain relationship:

  • F :dblline: D :arrow: G

    From G, we can ride "backwards" over the arrow (which is a "some" relationship going that direction) to F, and there's a negative there. The lowest strength term along the chain is "some," and so the inference is G :some: F.

Get the most out of your LSAT Prep Plus subscription.

Analyze and track your performance with our Testing and Analytics Package.