JC1 H3 Mathematics Tutor Bukit Timah | Logical Connectives and De Morgan’s Laws. Did you know? The phrase “not both” does not mean the same thing as “neither”. That distinction appears in mathematical proof, probability, inequalities and questions involving conditions that must be met simultaneously.
For JC1 H2 Mathematics learners in Bukit Timah, Beauty World and Sixth Avenue, logical connectives are useful whenever a solution combines requirements, rules out outcomes or splits cases. This guide explains and, or, not and implies, before extending them to precise De Morgan transformations.
The quick answer
- P and Q requires both statements true.
- P or Q is true if at least one is true; in ordinary mathematical logic, both may be true.
- Not P reverses P’s truth value.
- P implies Q rules out a case where P is true but Q is false.
- Not (P and Q) means (not P) or (not Q).
- Not (P or Q) means (not P) and (not Q).
For a real number x, “not (x>1 and x<4)” means x≤1 or x≥4. By contrast, “not (x>1 or x<4)” would require x≤1 and x≥4 simultaneously, which is impossible. The two parentheses describe different claims.
Why De Morgan’s laws matter
A compound claim may describe a region, a collection of outcomes, or the hypotheses of a theorem. To negate the whole claim, each component changes and the connective swaps from and to or—or from or to and. In a probability question, the complement of “A or B” is “not A and not B”. In a proof, the negation of “P and Q” permits either requirement to fail.
Never confuse converse and contrapositive
The implication P⇒Q is equivalent to (not Q)⇒(not P), its contrapositive. It need not be equivalent to the converse Q⇒P. For integers, divisibility by four implies evenness, but evenness does not imply divisibility by four. This is a useful example to check whether the right arrow was kept.
Worked examples: De Morgan’s laws in algebra and sets
Example 1: An open interval and its complement
The condition x>1 and x<4 holds only for the real interval (1,4). Its negation requires either x≤1 or x≥4. Both endpoints belong to the complement because they fail the original strict inequalities.
A common incorrect negation is “x≤1 and x≥4”, which no real number satisfies. De Morgan’s law changes and to or, because the original conjunction fails as soon as either of its requirements fails.
Example 2: A disjunction that covers every real number
Consider x>1 or x<4. Every real x satisfies at least one branch. Those less than or equal to one satisfy x<4, those at least four satisfy x>1, and the intervening numbers satisfy both.
The negation is x≤1 and x≥4, which is impossible. This demonstrates that mathematical or is inclusive: the two branches are permitted to overlap, and in this example their union covers the entire real line.
Example 3: Neither is stronger than not both
Let P mean “n is divisible by two” and Q “n is divisible by three”. The statement “not both” permits n=4 because it fails Q; “neither” excludes n=4 because it satisfies P.
The precise translations are not(P and Q)=(not P) or (not Q), and not(P or Q)=(not P) and (not Q). Confusing them can change the number of acceptable outcomes in a counting problem.
Example 4: At least one and exactly one
The condition P or Q is true when either or both propositions are true. “Exactly one” instead means (P and not Q) or (Q and not P), which excludes the both-true case.
For P “divisible by two” and Q “divisible by three”, the integer six satisfies at least one but not exactly one. Identify whether the question uses “or”, “either but not both”, or “exactly one” before counting.
Example 5: A closed interval with two endpoint checks
The conjunction 2≤x and x≤6 describes the closed interval [2,6]. Its complement over the real numbers is x<2 or x>6, two separate open rays.
Both endpoints satisfy the original inequalities, so neither belongs to the complement. Writing x≤2 or x≥6 would incorrectly admit them. Boundary symbols determine the answer as surely as any calculation.
Example 6: The complement of two separated rays
The real condition x<−1 or x>3 describes two open rays. The opposite condition is x≥−1 and x≤3, a single closed interval.
One practical check is to test x=0: it fails the original disjunction and satisfies the complement. The conjunction of the two negated inequalities is what closes the gap between the rays.
Example 7: An empty feasible set
Suppose a mathematical model simultaneously requires x≤1 and x≥4. No real x satisfies both. The correct result is an empty feasible set, not a numerical answer obtained by changing a sign.
A model can be inconsistent. Recognising mutually incompatible requirements is itself an important mathematical conclusion. A tutor should teach students to report infeasibility clearly instead of trying to force a candidate.
Example 8: Truth table for the first De Morgan rule
The four possible assignments to P and Q are true–true, true–false, false–true and false–false. The expression not(P and Q) is false only in the first case.
The expression (not P) or (not Q) has identical values in all four cases. Because the assignments are exhaustive, this is a complete proof of the equivalence, not just a few illustrative tests.
Example 9: Truth table for the second De Morgan rule
The negation not(P or Q) is true only when P and Q are both false. The conjunction (not P) and (not Q) also holds only in that case.
Therefore the two expressions are equivalent. This rule gives the exact logic of neither: both original conditions must fail. The result appears in set complements and probability events as well as in logical notation.
Example 10: Distribute a shared restriction
The condition x>0 and (x<1 or x>3) is equivalent to (x>0 and x<1) or (x>0 and x>3). Its solution is 0
Distributing the conjunction makes it easier to sketch the region and check the boundaries. All three threshold values are excluded because the original comparisons are strict. A graphical check should agree with the algebraic form.
Example 11: A real square and a restricted input
Consider “x≥0 and x²≤9”. The two requirements together give 0≤x≤3. The squared inequality by itself permits −3≤x≤3, but the additional nonnegative condition removes the negative branch.
When combining an algebraic result with a domain condition, use logical and. The intersection must satisfy both requirements. Treating the conditions as alternatives would incorrectly add extra solutions.
Example 12: The complement of a positivity condition
For real variables x and y, “x≥0 and y≥0” means both coordinates are nonnegative. Its negation is “x<0 or y<0”: one negative coordinate is enough to break the original condition.
The inaccurate negation “x<0 and y<0” excludes too few cases, since it ignores points with one negative coordinate. This is a direct and useful two-variable application of the first De Morgan law.
Worked examples: implications, inverses and contrapositives
Logic check 1: When is an implication actually false?
For propositions P and Q, P⇒Q is false only when P is true and Q is false. If the hypothesis P is false, the material implication does not assert that Q is true.
For example, n=3 cannot disprove “if four divides n then n is even”: three is not a multiple of four. A counterexample would have to be a multiple of four that is odd.
Logic check 2: The direction of only if
The phrase “P only if Q” translates to P⇒Q. “An integer is divisible by eight only if it is even” is true because every multiple of eight is even.
The phrase “P if Q” instead translates to Q⇒P, which is a different statement. Identifying the role of the clause after “if” prevents a common error before the proof begins.
Logic check 3: A true statement with a false converse
The claim “if n is divisible by four, n is even” is true for every integer n. Its converse, “if n is even, n is divisible by four”, is false because six is even but not divisible by four.
The converse is a new proposition and needs its own proof. One valid arrow does not justify writing an equivalence sign or using both directions interchangeably.
Logic check 4: A useful contrapositive
The contrapositive of P⇒Q is (not Q)⇒(not P). For the divisibility statement, it says an odd integer cannot be a multiple of four. This is true and logically equivalent to the original implication.
Contrapositive reasoning often makes a proof easier because the negation of a conclusion creates a convenient assumption. It must not be confused with proving the converse.
Logic check 5: The inverse is not the contrapositive
The inverse of P⇒Q is (not P)⇒(not Q). In the divisibility example this says that a number not divisible by four must be odd.
The integer six defeats that statement. The inverse and converse may both be false while the original implication remains true. Write the complete logical structure rather than relying on the sound of the term.
Logic check 6: Negating an implication
The negation of P⇒Q is P and (not Q). To disprove “if an integer is divisible by three then it is positive”, choose n=0. It is divisible by three, yet it is not positive.
A negative integer not divisible by three would not be a valid counterexample because it fails the initial hypothesis. This is a useful proof-quality check.
Logic check 7: An if-and-only-if needs two arguments
For integers n, being divisible by six is equivalent to being divisible by two and three. If n=6k, both divisibilities hold. Conversely, if two and three divide n, their coprimality gives six dividing n.
These arguments establish both directions. A student who proves only the first must not call the condition necessary and sufficient until the reverse has been justified.
Logic check 8: The word or in a zero-product solution
If (x−2)(x+3)=0 over the reals, then x=2 or x=−3. Each root is a permitted alternative; x is not simultaneously required to equal both values.
In equations obtained from squaring or cancelling denominators, return to the original expression to check that each alternative remains admissible. Logical disjunction does not remove domain restrictions.
Logic check 9: A domain is an intersection
For f(x)=1/√(x−2), the square root requires x−2≥0 and the denominator requires √(x−2)≠0. Together they give x>2.
The value x=2 satisfies the first restriction but fails the second. Domains typically combine conditions by and, not by or, because every requirement must hold for an input to be valid.
Logic check 10: An implication inside a calculus theorem
If f is differentiable at an interior local maximum c, then f′(c)=0. The converse “if f′(c)=0 then there is a local maximum” is false.
Take f(x)=x³ at c=0. It has zero derivative but continues increasing. The theorem gives a necessary condition, not a sufficient one. This is why logical arrows matter in H2 calculus.
Logic check 11: A proof by contradiction uses conjunction
To prove that an even integer cannot have an odd square, assume n is even and n² is odd. Write n=2k; then n²=4k² is even, which contradicts the second assumption.
The contradiction is between two properties that cannot both hold. It is not enough to write the word “contradiction” at the end of an unexplained algebraic manipulation.
Logic check 12: Three conditions, not just two
Negating P and Q and R gives (not P) or (not Q) or (not R). An input fails a triple conjunction if it violates at least one requirement.
Similarly, negating P or Q or R gives all three negations joined by and. The repeated use of De Morgan’s laws scales beyond two conditions, provided every logical component is included.
Logic check 13: Proof by cases from an or decomposition
Every integer n is even or odd. To prove n(n+1) is even, handle each case: if n is even the first factor is even; otherwise n is odd and the second factor is even.
The two cases cover all integers. This is a valid use of or in proof organisation, because the final result is established in every possible category.
Logic check 14: A proposition that is always true
For every real x, x≤0 or x≥0. The two alternatives cover the entire real line and overlap at zero. The disjunction is always true.
This does not imply that every x satisfies both comparisons. Inclusive or permits overlap but does not require it. A truth table and a number-line diagram express the same logical meaning.
Logic check 15: A proposition that is always false
The conjunction x<0 and x>0 is impossible over the real numbers. Its negation x≥0 or x≤0 is universally true.
This simple example shows how a contradiction in conditions creates an empty feasible set. A student should recognise the logic before attempting to solve unrelated equations.
Logic check 16: The logic of a piecewise function
Consider f(x)=x² if x≥0 and f(x)=−x if x<0. The two conditions divide real inputs into exhaustive cases; they do not overlap.
Every real input satisfies exactly one branch, so the function is well-defined by these cases. If both branches included zero and assigned different values, the piecewise rule would fail to define a unique output there.
Set complements and probability translations
Application 1: Set union complements
For two sets A and B in a universe U, the complement of A∪B contains elements in neither A nor B. Therefore (A∪B)ᶜ=Aᶜ∩Bᶜ. This is De Morgan’s law for sets. The universe matters because a complement is always relative to a specified collection of possible elements.
Application 2: Set intersection complements
The complement of A∩B contains any element that fails at least one membership condition. Hence (A∩B)ᶜ=Aᶜ∪Bᶜ. An element in A but not B qualifies; replacing the union with an intersection would wrongly exclude it. Element-by-element reasoning proves the identity more reliably than unlabelled shading.
Application 3: At least one event
If event A is passing a Mathematics quiz and B is passing a Science quiz, failing both is the complement of passing at least one. Symbolically (A∪B)ᶜ=Aᶜ∩Bᶜ. The probability of neither is 1−P(A∪B), and no independence assumption is needed for this complement formula.
Application 4: Probabilities with an overlapping event
If P(A)=0.6, P(B)=0.5 and P(A∩B)=0.2, then P(A∪B)=0.6+0.5−0.2=0.9. The probability of neither is 0.1. Straight addition would yield the impossible result 1.1 because it counts the intersection twice. The set relation explains precisely which adjustment is needed.
Application 5: The difference between exactly one and at least one
In a class of 40, suppose 24 pupils attend activity A, 19 attend B and eight attend both. At least one activity includes 24+19−8=35; neither includes five; exactly one includes (24−8)+(19−8)=27. The three answers differ because their logical conditions describe different subsets.
Application 6: Universal quantifier and negation
The negation of “for every real x, x²≥0” is “there exists a real x with x²<0”. That negation is false, matching the truth of the original statement. Negating for all changes it to there exists, while the property is also negated. Do not confuse not all with none.
Application 7: Negating an existence claim
The claim “there exists real x with x²=−1” is false. Its negation says “for every real x, x²≠−1”, which is true because real squares are nonnegative. This is the dual rule to negating a universal statement and shows why domains are central to the argument.
Application 8: Count by taking the complement
Among integers 1 through 30, there are fifteen multiples of two, ten of three and five of both. Inclusion–exclusion counts twenty divisible by at least one, leaving ten divisible by neither. The complement of “multiple of two or three” means “not a multiple of two and not a multiple of three”.
Further applications and proof checks
Challenge 1: A contradiction in model constraints
The conditions x>0 and x≤0 have no common real solution. The problem is not solved by trying more numerical inputs: the conjunction is inconsistent. Report the feasible set as empty, explaining that no real number can be simultaneously strictly positive and nonpositive.
Challenge 2: A zero-product disjunction with domain check
The equation (x−2)(x+3)=0 gives x=2 or x=−3. But if a separate condition says x≥0, only x=2 is permitted. The equation’s alternatives and the domain restriction combine through and, producing the correct final solution set.
Challenge 3: Exactly one from two events
The event “exactly one of A and B occurs” can be expressed as (A∩Bᶜ)∪(Aᶜ∩B). The pieces are disjoint, so their probabilities may be added without an overlap subtraction. This is a clearer model than guessing a formula from the phrase “either activity”.
Challenge 4: Disjoint and independent are not equivalent
If A and B are disjoint events with positive probabilities, P(A∩B)=0. Independence would instead require P(A∩B)=P(A)P(B)>0. Therefore they cannot be both disjoint and independent. These are two distinct mathematical relationships, despite their similar everyday connotations.
Challenge 5: Combining domain conditions
For the real expression √(x−1)/(x−3), the square root requires x≥1 and the denominator requires x≠3. Both conditions must hold. The domain is x≥1 and x≠3, which can also be written 1≤x<3 or x>3.
Challenge 6: A nested negation in an integer claim
Every integer n is even or has an even successor. If n is even, the first branch holds; if n is odd, n+1 is even. Its negation would require one integer that is not even and whose successor is not even, which cannot occur.
Challenge 7: Three connected requirements
The negation of P and Q and R is not P or not Q or not R. Any one failed requirement defeats the conjunction. By contrast, the negation of P or Q or R requires all three to fail. Repeating De Morgan’s laws extends them beyond two propositions.
Challenge 8: Logical distribution in algebraic constraints
The condition x>0 and (x<1 or x>3) can be distributed to give (x>0 and x<1) or (x>0 and x>3). The solution is 0
Independent practice and model answers
- Negate x>1 and x<5.
- Negate x≤0 or x≥3.
- Give a counterexample to the converse “even implies divisible by four”.
- Explain the distinction between at least one and exactly one.
- State the complement of A∪B.
- Count exactly-one memberships when 20 attend A, 17 attend B and five attend both.
- Write the condition that falsifies P⇒Q.
The answers are x≤1 or x≥5; 0 The 2027 H3 Mathematics 9820 syllabus names and, or, not, implies and negation. De Morgan’s laws are useful deductions from these listed connectives; they are not given as their own heading. No. Standard logical or is inclusive and allows the two conditions to be true together. The words “exactly one” or “either but not both” impose a different requirement. Write it as a separate statement, then seek a proof or an admissible counterexample. The truth of an original implication alone does not establish its converse. No. It supports JC1 H2 reasoning and possible H3 readiness. Subject offerings and tutor availability must be confirmed with the school and provider respectively. See the 2027 A-Level syllabus directory, quantifiers and counterexamples, and necessary and sufficient conditions for connected reasoning practice. The immutable eduKateSG Mathematics reference describes a three-student tutorial approach near Sixth Avenue MRT. It remains unchanged; contact eduKate Singapore to check suitable JC Mathematics teaching, actual availability, fees and times. Did you know? Once a learner can consistently distinguish and, or, not and implies, many seemingly complicated problems become accurate set descriptions before the calculation begins. The 2027 H3 Mathematics 9820 syllabus lists and, or, not, implies, quantifiers, converse, inverse and contrapositive. H2 Mathematics remains the foundation for a JC1 learner. The immutable Mathematics tutorial reference describes the three-student approach near Sixth Avenue MRT, but does not guarantee a JC1 H3 specialist or place. Ask eduKate Singapore about suitable JC Mathematics tutorials and current availability.Frequently asked questions
Are De Morgan’s laws separately named in the H3 Mathematics syllabus?
Is or exclusive in Mathematics?
How can I check the validity of a converse?
Does this guide guarantee H3 tuition availability?
Official reading and a next step
Official syllabus and local learning