Fundamentals of Logical Reasoning

Fundamentals of Logical Reasoning

Logical reasoning is the backbone of critical thinking, mathematics, computer science, and everyday decision‑making. This course unpacks the core concepts tested in a typical logical‑reasoning quiz, turning each question into a learning opportunity. By the end of the lesson you will understand how to negate statements, identify logical laws, differentiate between conjunction, disjunction, and exclusive‑or, and correctly formulate conditional statements.

1. Negating Compound Statements

Negation flips the truth value of a proposition. For simple statements, the rule is straightforward: "It is raining" becomes "It is not raining". When a statement contains logical connectives such as and (∧) or or (∨), De Morgan’s laws guide the transformation.

• De Morgan’s Law for "and": ¬(A ∧ B) ≡ (¬A) ∨ (¬B)
• De Morgan’s Law for "or": ¬(A ∨ B) ≡ (¬A) ∧ (¬B)

Consider the quiz question: "What is the correct negation of the statement ‘The number 6 is divisible by 2 and 3’? The original statement can be expressed as:

A: 6 is divisible by 2 and B: 6 is divisible by 3. Its negation, according to De Morgan, is ¬A ∨ ¬B – i.e., "6 is not divisible by 2 or 6 is not divisible by 3". However, because 6 is divisible by both, the most precise negation in everyday language is "6 is not divisible by 2 or 3". The answer choice "The number 6 is not divisible by 2 or 3" captures this meaning and is the correct choice.

2. Logical Laws and Their Violations

Logical laws are principles that any rational argument must respect. The most frequently referenced are:

• Law of Identity: Every proposition is identical to itself (A = A).
• Law of Non‑Contradiction: A proposition cannot be both true and false simultaneously (¬(A ∧ ¬A)).
• Law of Excluded Middle: For any proposition, either it or its negation must be true (A ∨ ¬A).
• Law of Sufficient Reason: Everything that exists or occurs must have a reason or cause.

Two quiz items illustrate how to spot violations:

• "If a person is beautiful then she will be an excellent student" – This statement assumes a causal link without evidence, breaching the Law of Sufficient Reason.
• "This medicine is good because its price is very high" – Again, the reason given (high price) does not logically explain the medicine’s quality, violating the same law.

Recognizing such fallacies is essential for constructing sound arguments and for evaluating the credibility of everyday claims.

3. Understanding Logical Connectives

Logical connectives combine simpler propositions into more complex ones. The most common are:

• Conjunction (∧): Both components must be true. Example: "It is sunny and warm".
• Disjunction (∨): At least one component is true. Example: "It is sunny or rainy".
• Exclusive Or (XOR): Exactly one component is true, but not both.
• Implication (→): If the antecedent is true, the consequent must be true; otherwise the statement is vacuously true.

In the quiz, the sentence "Long lanh đáy nước in Trời, Thành xây khói biếc, non phơi bóng vàng" uses commas to link clauses. The correct analysis is that the first comma indicates a conjunction (both ideas occur together), while the second comma separates alternatives, representing a disjunction. Hence the answer "(1) conjunction, (2) disjunction" is correct.

4. Causal Implication vs. Simple Conjunction

Not all "if‑then" statements are mere logical conjunctions. A statement like "When a nation is united, it will inevitably win" expresses a causal relationship: unity leads to victory. This is best described as a causal implication, not a simple logical equivalence or conjunction. Understanding the nuance helps differentiate between descriptive facts and predictive claims.

5. Forming Correct Disjunctions

A disjunction combines two propositions such that the overall statement is true if either proposition is true. For the pair "Nam is diligent" and "Nam studies very well", the proper disjunction is phrased as "Nam studies very well or Nam is diligent". This mirrors the logical form P ∨ Q and matches the quiz answer.

6. Exclusive‑Or (XOR) Explained

The XOR operation returns true only when the truth values of its operands differ. In truth‑table terms:

• P = T, Q = T → XOR = F
• P = T, Q = F → XOR = T
• P = F, Q = T → XOR = T
• P = F, Q = F → XOR = F

This operation is useful in digital circuits, error‑detecting codes, and situations where exactly one condition must hold. The quiz correctly identifies "Exclusive or" as the operation that yields true when P and Q differ.

7. Negating Conditional Statements

Conditionals have the form "If A then B" (A → B). Their negation is not another conditional but a conjunction of the antecedent with the negation of the consequent: ¬(A → B) ≡ A ∧ ¬B. Applying this to the example "If tomorrow is Wednesday then today must be Monday" gives the negation "Tomorrow is Wednesday and today is not Monday". However, the quiz asks for the "proper negation" in conditional form, which is "If tomorrow is Wednesday then today is not Monday" – a direct restatement of A → ¬B.

8. Summary of Key Takeaways

• Use De Morgan’s laws to negate compound statements involving "and" and "or".
• Identify which logical law is violated when a claim lacks a rational basis (Law of Sufficient Reason).
• Distinguish between conjunction (both true), disjunction (at least one true), and exclusive‑or (exactly one true).
• Recognize causal implication as a special form of conditional that suggests a cause‑effect relationship.
• Negate conditionals by converting them to a conjunction of the antecedent and the negated consequent, or by restating the conditional with the negated consequent.

9. Practice Exercises

Apply what you have learned with these additional problems:

1. Negate the statement: "All birds can fly and sing".
2. Identify the logical law breached by the claim: "The more expensive a car, the faster it must be".
3. Write the truth table for the exclusive‑or operation and explain why it is useful in error detection.
4. Convert the conditional "If it rains, the ground gets wet" into its logical negation.
5. Form a correct disjunction using the propositions: "The library is open" and "The cafe is closed".

Review your answers against the concepts discussed above to reinforce mastery.