- Joined
- Apr 2025
- Subscription
- Free
Admissions profile
Discussions
The statement for the disjunction example is: " If N or O is not adopted, then M cannot be adopted" (same from previous examples) – "Let's try this again. This time, let's say that the initial conditional statement is this:/N or /O → /M"
The lawgic would read /N or /O--->/M
Then we would take the contrapositive by flipping and negating both sides leading us to
M--->/(/N or /O)
We are left with M because "That's a lot of /'s but don't worry, remember that negations cancel out." – if you negate something that's already negated then you're left with its "positive form"
We left the negation on (/N or /O) because we are trying to determine if it applies to both or just one of the disjuncts.
This is when we use De Morgan's Law "to negate a disjunction, swap the "or" (disjunction) for an "and" (conjunction) and negate each of the disjuncts"
Leaving us with the final answer
M---> N and O
Hope this helps and someone plz correct me if I'm wrong!
The correct negation for "Some unicorns poop rainbows. U ←s→ PR"
as shown above, is U→/PR.
No unicorns poop rainbows, or if you are a unicorn you don't poop rainbows.