- Tue Jan 12, 2021 12:47 am
#83170
In this argument this premises states
P: BUN17 CP
It then goes to conclude from this that
C: HB CP
There are two ways that we can essentially draw that conclusion;
1. We can add BUN17 HB. This works because we know that most statements include some (remember that ladder in the textbook where the upper rung include the lower rung) so we confidently say that since BUN17 CP then we are also able to say BUN17 CP. Using this statement we can connect the chain now HB BUN17 CP. From this we can conclude HB CP which is our conclusion.
2. We can use the little exception of two most statements (aforementioned) leading away from a common variable to infer a some statement. For this question since the most statement leads away from the BUN17 that would have to be the common variable, so the most statement that we can add is BUN17 HB. Since Most BUN17 are HB, and most BUN17 are CP then we can infer that at least some HB are CP. To show as a diagram;
HB <—most BUN17 CP = HB CP.
Answer D used this second way.
I hope this was clear. If not I strongly suggest looking back at the formal logic chapter in the Logical Reasoning Bible if you have it available to you.
Good luck!
theamazingrace wrote: ↑Mon Jan 11, 2021 11:41 pm This is how I got D:Hi! I’m not an expert by any means but feel I can address your question or perhaps lead you back to the formal logic chapter in the textbook for clarification. As for your question, you have to be careful about what you are connecting some/most statements too... X Y cannot connect with a most statement or another some statement. There is one specific instance with most statements that is worth remembering which is when two most lead away from a common variable. Ex. X <—(most) Y Z from which we can infer that X Z. This is what people are talking about in this thread about 2 most statements.
BUN17 CP HSB
I see people talking about two mosts to come up with D, what am I missing?
Thanks!
In this argument this premises states
P: BUN17 CP
It then goes to conclude from this that
C: HB CP
There are two ways that we can essentially draw that conclusion;
1. We can add BUN17 HB. This works because we know that most statements include some (remember that ladder in the textbook where the upper rung include the lower rung) so we confidently say that since BUN17 CP then we are also able to say BUN17 CP. Using this statement we can connect the chain now HB BUN17 CP. From this we can conclude HB CP which is our conclusion.
2. We can use the little exception of two most statements (aforementioned) leading away from a common variable to infer a some statement. For this question since the most statement leads away from the BUN17 that would have to be the common variable, so the most statement that we can add is BUN17 HB. Since Most BUN17 are HB, and most BUN17 are CP then we can infer that at least some HB are CP. To show as a diagram;
HB <—most BUN17 CP = HB CP.
Answer D used this second way.
I hope this was clear. If not I strongly suggest looking back at the formal logic chapter in the Logical Reasoning Bible if you have it available to you.
Good luck!