Summary
A quantifier tells how many values of x a statement p(x) refers to. The universal quantifier ∀ means “for all”, “for every”, “each”. The existential quantifier ∃ means “there exists”, “for some”, “at least one”. Putting a quantifier in front of an open sentence turns it into a statement. This is the second way to make a statement from an open sentence.
∀x ∈ A, p(x) is true only if p(x) holds for every x in A, so one counter-example makes it false. ∃x ∈ A, p(x) is true if p(x) holds for at least one x in A, so one example is enough. Always test the values of the given set A, and take N = {1, 2, 3…
Key formulas
- ~(p ∧ q)
- ~p ∨ ~q
- ~(p ∨ q)
- ~p ∧ ~q
- ~(p → q)
- p ∧ ~q
- ~(p ↔ q)
- (p ∧ ~q) ∨ (~p ∧ q) ≡ p ↔ ~q
- ~(∀x, p(x))
- ∃x, ~p(x)
- ~(∃x, p(x))
- ∀x, ~p(x)
- Dual
- Swap ∧ and ∨, t and c; leave ~ alone
- Converse / Inverse / Contrapositive
- q → p / ~p → ~q / ~q → ~p
- Equivalences
- p → q ≡ ~q → ~p; q → p ≡ ~p → ~q
What this note covers
- Quantifiers and quantified statements
- Duality
- Negation of compound statements
- Converse, inverse and contrapositive
Solved past-paper question (MHT-CET 2020)
Let A = {2, 3, 4, 5, 6}. Which statement has truth value false?
- (A) ∃x ∈ A such that x + 2 is a prime number
- (B) ∃x ∈ A such that x² + 1 is an even number
- (C) ∀x ∈ A, x + 6 is divisible by 2
- (D) ∃x ∈ A such that (x − 2) ∈ N
Solution
Test each statement for the set A = {2, 3, 4, 5, 6}. The false one is the answer.
A: x = 3 gives x + 2 = 5, a prime. So ∃x is true.
B: x = 3 gives x² + 1 = 10, which is even. So ∃x is true.
D: x = 3 gives x − 2 = 1, which is in N. So ∃x is true.
C: ∀x, x + 6 divisible by 2. For x = 3 we get 9, which is odd. One counter-example makes it false.
x = 3 ⇒ x + 6 = 9
So C is false.
Answer: (C) ∀x ∈ A, x + 6 is divisible by 2
Common mistake: Testing a ∀ statement on one value that works. One failure is enough to make it false.
The full note has 10 solved questions, 10 practice questions, figures and a topic test. Reading it on PrepKi is free after you log in.
PDF download is included in PrepKi plans. See plans.