Public Enterprise Korean Language Logic Ch2. De Morgan’s Law and Complex Propositions — Confusing...
Chapter 2. De Morgan’s law and negation of complex propositions
When negating a compound proposition, simply adding ‘an’ or ‘not’ in front of the word is the way of the underdogs. Experts ‘flip’ the logical structure of the entire sentence through De Morgan’s Law. In particular, in public enterprise writing, negation is induced through the question “Which of the following is not true?”, so this rule is like a survival skill.
1. DeMorgan’s Core: Switch Strategy
When the negation sign (~) enters parentheses, two things change:
- True/False of each element changes.
- The connecting link connector (∧, ∨) switches.
2. Strategic understanding of the ‘or(∨)’ proposition
When you encounter the sentence “It is either A or B” in a public enterprise exam, you must think of the following three things at the same time. (This is the core of the 200,000 won lecture.)
- At least one person: At least one of A and B is true. (both can be true)
- 조건문 변환: ~A → B (A가 아니면 무조건 B여야 한다)
- Remove declaration: What if A ∨ B is true but A is false? → B is unconditionally true.
3. Evolving problem solving (Step 5: De Morgan application)
Problem 4: When the proposition “I eat fruits and vegetables” is false, what is necessarily true?
- I don’t eat fruit and I don’t eat vegetables.
- If you don’t eat fruit, eat vegetables.
- Don’t eat fruit or vegetables.
- If you eat vegetables, don’t eat fruit.
[Thought Process]
- Symbolization: Fruit (A) ∧ Vegetable (B)
- Negative application: ~(A ∧ B) ≡ ~A ∨ ~B
- Interpretation: “I don’t eat fruit (OR) or I don’t eat vegetables.”
Correct answer: 3
4. Solving evolving problems (Step 6: Chain of complex negation)
Problem 5: If all of the following premises are true, which one is necessarily true?
- Premise 1: Either A passes or B passes.
- Premise 2: If A passes, B also passes.
- Premise 3: The bottle did not pass.
- Student B did not pass.
- Both A and B passed.
- Student B passed.
- Person A passed.
[Step-by-Step Algorithm]
- Symbolization: (1) A ∨ Eul, (2) A → Byeong, (3) ~ Byeong (confirmed!)
- Start inference:
- Since it is a disease (3), based on the treatment in premise 2 (~ disease → ~A), A is confirmed to have failed (~A).
- In premise 1 (A ∨ B), ‘A’ was found to be false, so by the ‘declaration removal’ rule, the remaining one, ‘B’, must be true (pass).
- Conclusion: Student B passed.
Correct answer: 3
🚀 Insight from the 200,000 won lecture
In practice, De Morgan’s law itself does not appear alone, but is combined with declaration removal (A∨B, ~A ∴B) as in the above problem. When you see information that says “A or B,” always prepare for the “the moment it turns out that it’s not one of them, the other one is the culprit.”**
In the next supplementary lesson, you will learn how to solve difficult quizzes with insufficient information through reductio ad subjunctive law and number of cases.
Oiyo
Content Editor지식 인큐베이터이자 전문 콘텐츠 크리에이터. 경영, 경제, 법률 및 실생활에 유용한 실무/자격증 중심의 깊이 있는 정보를 연구하고 공유합니다.