User Avatar
apternoah332
Joined
Apr 2025
Subscription
Free
PrepTests ·
PT152.S4.Q13
User Avatar
apternoah332
Saturday, Aug 03 2024

Such a bullshit stimulus (pardon my language). Trading on an ambiguity is completely unfair imo.

0
User Avatar
apternoah332
Thursday, Oct 19 2023

Scores will probably drop slightly, as most 175+ test takers are perfect LG scorers. -0 LG sections are a breeze once you’ve mastered LG, whereas there can always be a few soul crushing LR questions even for the best test takers IMO.

0
User Avatar
apternoah332
Friday, Jul 07 2023

To clarify this paragraph: "Then we apply Morgan's law..." The equivalency is derived from the following reasoning: if B is not true, it cannot be the case that both B and C are true. This is logically guaranteed. If C were not true, it again cannot be the case that both B and C are true. Just trying to show the equivalency of the two statements (how the last step of Morgan's law is worked out).

0
User Avatar
apternoah332
Friday, Jul 07 2023

(inserted into original comment)

0
User Avatar
apternoah332
Friday, Jul 07 2023

Let me try to explain it as best I can: let's say we start with the conditional:

A → B and C

We know from previous lessons that If A is true, B and C must both be true (indicated by the conjunction "and."

Let's say we want to take the contrapositive. So we flip the conditional and negate the condition and result (each side). We then end up with:

/(B and C) → /A

Your question is essentially, what do the parentheses function as? We know that in the original condition, B and C must both be true if A is true. So we can think of B and C as one moving "unit." Imagine B and C are two soldiers in a military unit and need to stick together (not sure if that analogy will stick lol). So if we think of the truth of B and C as one unit or block, we should negate it as such when taking the contrapositive. So instead of negating B and C individually, we first negate the unit of B and C itself.

Then we apply Morgan's law, since saying "if it is not the case that both B and C are true . . . " is equivalent, logically, to saying "if either B or C is not true . . ."

If it is not the case that both B and C are true, either B or C MUST BE FALSE. This is an example of how Morgan's Law works. Does this make sense?

To add to my last remarks about Morgan's Laws:

We would transpose /(B and C) → /A into the following using Morgans laws:

/B or /C → /A. This is the final product.

Let me know if you have any questions. If I'm explaining this poorly, let me know. I'm doing it partly for my own understanding.

3

Confirm action

Are you sure?