Negating quantified statements

𝑝(𝑥) is true for every 𝑥 in 𝐷 ⇒ ∀𝑥 𝑃(𝑥) − 𝑇

∀𝒙 𝑷(𝒙), 𝒙 ∈ 𝑫 There is an 𝑥 in 𝐷 such that 𝑃(𝑥) is false ⇒ ∀𝑥 𝑃(𝑥) − 𝐹
¬[∀𝑥 𝑃(𝑥)] ≡ ∃𝑥 ¬𝑃(𝑥)
𝑃(𝑥) is true for at least one 𝑥 in 𝐷 ⇒ ∃𝑥 𝑃(𝑥) − 𝑇
∃𝒙 𝑷(𝒙), 𝒙 ∈ 𝑫 For no 𝑥 in 𝐷 𝑃(𝑥) is true ⇒ ∃𝑥 𝑃(𝑥) − 𝐹
¬[∃𝑥 𝑃(𝑥)] ≡ ∀𝑥 ¬𝑃(𝑥)

𝑝−𝑇 ¬𝑝 − 𝐹
∀𝑥 𝑃(𝑥) − 𝑇 ∃𝑥 𝑃(𝑥) − 𝑇 ⇒ ∀𝑥 𝑃(𝑥), ∃𝑥 𝑃(𝑥) can not be the
∃𝑥 𝑃(𝑥) − 𝑇 ∀𝑥 𝑃(𝑥) − 𝑇 or 𝐹 negation of each other.
∀𝑥 𝑃(𝑥) − 𝑇 ∃𝑥 ¬𝑃(𝑥) − 𝐹
(Necessary and Sufficient)
∀𝑥 𝑃(𝑥) − 𝑇 ∀𝑥 ¬𝑃(𝑥) − 𝐹 ⇒ ¬[∀𝑥 𝑃(𝑥)] ≡ ∃𝑥 ¬𝑃(𝑥)
(Not necessary)
∃𝑥 𝑃(𝑥) − 𝑇 ∃𝑥 ¬𝑃(𝑥) − 𝑇 or 𝐹 ⇒ ∃𝑥 𝑃(𝑥), ∃𝑥 ¬𝑃(𝑥) can not be the
(Not sufficient) negation of each other.
∃𝑥 𝑃(𝑥) − 𝑇 ∀𝑥 ¬𝑃(𝑥) − 𝐹 ⇒ ¬[∃𝑥 𝑃(𝑥)] ≡ ∀𝑥 ¬𝑃(𝑥)
(Necessary and Sufficient)
Write a logical expression for the following statements.
1. Every student in this class has studied Mathematics.
Soln : 𝑥: a student in this class. 𝑃(𝑥): 𝑥 has studied Mathematics.
Logical expression: ∀𝑥 𝑃(𝑥).
OR
𝑥: is a person . 𝑃(𝑥): 𝑥 belongs to this class. 𝑄(𝑥): 𝑥 has studied Mathematics.
Logical expression: ∀𝑥 [𝑃(𝑥) → 𝑄(𝑥)]. ≡ For every person 𝑥, if 𝑥 is a student in this class, then 𝑥 has studied Mathematics.
2. Some students in this class has visited Mexico.
Soln : 𝑥: a student in this class. 𝑃(𝑥): 𝑥 has visited Mexico.
Logical expression: ∃𝑥 𝑃(𝑥).
OR
𝑥: is a person. 𝑃(𝑥): 𝑥 belongs to this class. 𝑄(𝑥): 𝑥 has visited Mexico.
Logical expression: ∃𝑥 [𝑃(𝑥) ∧ 𝑄(𝑥)]. ≡ There is a person 𝑥 having the properties that 𝑥 is a student in this class and has visited Mexico.
3. Every student in this class has visited either Canada or Mexico.
Soln : 𝑥: a student in this class. 𝐶(𝑥): 𝑥 has visited Canada. 𝑀(𝑥): 𝑥 has visited Mexico.
Logical expression: ∀𝑥 [𝐶(𝑥) ∨ 𝑀(𝑥)].
OR
𝑥: is a person. 𝑃(𝑥): 𝑥 belongs to this class. 𝐶(𝑥): 𝑥 has visited Canada. 𝑀(𝑥): 𝑥 has visited Mexico.
Logical expression: ∀𝑥 {𝑃(𝑥) → [𝐶(𝑥) ∨ 𝑀(𝑥)]}. ≡ For every person 𝑥 ,if 𝑥 is a student in this class, then 𝑥 has visited either Canada or Mexico.
4. All lions are fierce.
Soln : 𝑥: is a lion. 𝑃(𝑥): 𝑥 is fierce.
Logical expression: ∀𝑥 𝑃(𝑥).
OR
𝑥: is an animal. 𝑃(𝑥): 𝑥 is a lion. 𝑄(𝑥): 𝑥 is fierce.
Logical expression: ∀𝑥 [𝑃(𝑥) → 𝑄(𝑥)]. ≡ For every animal 𝑥, if 𝑥 is a lion, then 𝑥 is fierce.
5. Some lions do not drink coffee.
Soln : 𝑥: is a lion. 𝑃(𝑥): 𝑥 drinks coffee.
Logical expression: ∃𝑥 ¬𝑃(𝑥).
OR
𝑥: is an animal. 𝑃(𝑥): 𝑥 is a lion. 𝑄(𝑥): 𝑥 drinks coffee.
Logical expression: ∃𝑥 [𝑃(𝑥) ∧ ¬𝑄(𝑥)]. ≡ There is an animal 𝑥 having the properties that 𝑥 is a lion and does not drink coffee.
6. Some fierce creatures do not drink coffee.
Soln : 𝑥: is a fierce creature. 𝑃(𝑥): 𝑥 drinks coffee.
Logical expression: ∃𝑥 ¬𝑃(𝑥).
OR
𝑥: is a creature. 𝑃(𝑥): 𝑥 is fierce. 𝑄(𝑥): 𝑥 drinks coffee.
Logical expression: ∃𝑥 [𝑃(𝑥) ∧ ¬𝑄(𝑥)]. ≡ There is a creature 𝑥 having the properties that 𝑥 is a lion and does not drink coffee.
7. All humming birds are richly colored.
Soln : 𝑥: is a humming bird. 𝑃(𝑥): 𝑥 is richly colored.
Logical expression: ∀𝑥 𝑃(𝑥).
OR
𝑥: is a bird. 𝑃(𝑥): 𝑥 is a humming bird. 𝑄(𝑥): 𝑥 is richly colored.
Logical expression: ∀𝑥 [𝑃(𝑥) → 𝑄(𝑥)]. ≡ For every bird 𝑥, if 𝑥 is a humming bird, then 𝑥 is richly colored.
8. No large birds live on honey.
Soln : 𝑥: is a large bird. 𝑃(𝑥): 𝑥 lives on honey.
Logical expression: ∀𝑥 ¬𝑃(𝑥).
OR
𝑥: is a bird. 𝑃(𝑥): 𝑥 is a large bird. 𝑄(𝑥): 𝑥 lives on honey.
Logical expression: ∀𝑥 [𝑃(𝑥) → ¬𝑄(𝑥)]. ≡ For every bird 𝑥, if 𝑥 is a large bird, then 𝑥 does not live on honey.
 9. Birds that do not live on honey are dull in color.
Soln : 𝑥: is a bird. 𝑃(𝑥): 𝑥 lives on honey. 𝑄(𝑥): 𝑥 is dull in color.
Logical expression: ∀𝑥 [¬𝑃(𝑥) → 𝑄(𝑥)]. ≡ For every bird 𝑥, if 𝑥 lives on honey, then 𝑥 is dull in color.
OR
𝑥: is a creature. 𝑃(𝑥): 𝑥 is a bird. 𝑄(𝑥): 𝑥 lives on honey. 𝑅(𝑥): 𝑥 is dull in color.
Logical expression: ∀𝑥 {[𝑃(𝑥) ∧ ¬𝑄(𝑥)] → 𝑅(𝑥)}. ≡ For every creature 𝑥, if 𝑥 is a bird and do not live on honey, then 𝑥 is dull in color.
10. Humming birds are small.
Soln : 𝑥: is a humming bird. 𝑃(𝑥): 𝑥 is small.
Logical expression: ∀𝑥 𝑃(𝑥).
OR
𝑥: is a bird. 𝑃(𝑥): 𝑥 is a humming bird. 𝑄(𝑥): 𝑥 is small.
Logical expression: ∀𝑥 [𝑃(𝑥) → 𝑄(𝑥)]. ≡ For every bird 𝑥, if 𝑥 is a humming bird, then 𝑥 is small.

Negate the following statements and express the negation in simple English.
1. All dogs have fleas.
Soln: 𝑥: is a dog. 𝑃(𝑥): 𝑥 has fleas.
Logical expression: ∀𝑥 𝑃(𝑥).
There is a dog without fleas.
Negation: ¬[∀𝑥 𝑃(𝑥)] ≡ ∃𝑥 ¬𝑃(𝑥) ⇒ {
Some dogs are without fleas.
2. There is a rabbit that knows calculus.
Soln: 𝑥: is a rabbit. 𝑃(𝑥): 𝑥 knows calculus.
Logical expression: ∃𝑥 𝑃(𝑥).
Negation: ¬[∃𝑥 𝑃(𝑥)] ≡ ∀𝑥 ¬𝑃(𝑥) ⇒ No rabbit knows calculus.
3. Not everyone in your class has an internet connection. ≡ All students in your class do not have an internet connection.
Soln: 𝑥: is a student in your class. 𝑃(𝑥): 𝑥 has an internet connection.
Logical expression: ∃𝑥 ¬𝑃(𝑥).
All students in your class have an internet connection.
Negation: ¬[∃𝑥 ¬𝑃(𝑥)] ≡ ∀𝑥 𝑃(𝑥) ⇒ {
Everyone in your class has an internet connection.
4. No monkey can speak French.
Soln: 𝑥: is a monkey. 𝑃(𝑥): 𝑥 can speak French.
Logical expression: ∀𝑥 ¬𝑃(𝑥).
There is a monkey that can speak French.
Negation: ¬[∀𝑥 ¬𝑃(𝑥)] ≡ ∃𝑥 𝑃(𝑥) ⇒ {
Some monkeys can speak French.
5. Some students are asking doubts.
Soln: 𝑥: is a student. 𝑃(𝑥): 𝑥 is asking doubts.
Logical expression: ∃𝑥 𝑃(𝑥).
Negation: ¬[∃𝑥 𝑃(𝑥)] ≡ ∀𝑥 ¬𝑃(𝑥) ⇒ No student is asking doubts.
6. Some students are not asking doubts.
Soln: 𝑥: is a student. 𝑃(𝑥): 𝑥 is asking doubts.
Logical expression: ∃𝑥 ¬𝑃(𝑥).
Negation: ¬[∃𝑥 ¬𝑃(𝑥)] ≡ ∀𝑥 𝑃(𝑥) ⇒ All students are asking doubts.

Translate the following statements into English.

1. 𝐶(𝑥): 𝑥 is a comedian. 𝐹(𝑥): 𝑥 is funny. 𝑥: set of all people.
𝑎) ∀𝑥 [𝐶(𝑥) → 𝐹(𝑥)]. ≡ All comedians are funny.
𝑏) ∀𝑥 [𝐶(𝑥) ∧ 𝐹(𝑥)]. ≡ All persons are funny comedians.
There exists a person 𝑥, if 𝑥 is a comedian, then 𝑥 is funny.
𝑐) ∃𝑥 [𝐶(𝑥) → 𝐹(𝑥)]. ≡ {
There is a comedian who is funny.
𝑑) ∃𝑥 [𝐶(𝑥) ∧ 𝐹(𝑥)]. ≡ Some comedians are funny.
 2. 𝑅(𝑥): 𝑥 is a rabbit. 𝐻(𝑥): 𝑥 hops. 𝑥: is an animal.
𝑎) ∀𝑥 [𝑅(𝑥) → 𝐻(𝑥)]. ≡ All rabbits hop.
𝑏) ∀𝑥 [𝑅(𝑥) ∧ 𝐻(𝑥)]. ≡ All animals are hoping rabbits.
There exists an animal 𝑥, if 𝑥 is a rabbit, then 𝑥 hops.
𝑐) ∃𝑥 [𝑅(𝑥) → 𝐻(𝑥)]. ≡ {
Some animals are hopping rabbits.
𝑑) ∃𝑥 [𝑅(𝑥) ∧ 𝐻(𝑥)]. ≡ Some rabbits hop.
3. 𝑃(𝑥): 𝑥 has id card. 𝑥: set of students. 𝑎) ∀𝑥 𝑃(𝑥) 𝑏) ∃𝑥 𝑃(𝑥) 𝑐) ∀𝑥 ~𝑃(𝑥) 𝑑) ∃𝑥 ~𝑃(𝑥)
4. If 𝐷 = {1,2,3,4}, 𝑃(𝑥) ∶ 𝑥 2 > 10, then find the truth values of the following statements.
a) ∀𝑥 𝑃(𝑥) − 𝐹. [Only 𝑃(4) is true.] b) ∃𝑥 𝑃(𝑥) − 𝑇. [𝑃(4) is true.] c) ∀𝑥 ~𝑃(𝑥) − 𝐹. [~𝑃(4) is false.] d) ∃𝑥 ~𝑃(𝑥) − 𝑇. [Only ~𝑃(4) is
false.] [Here, ∀𝑥 𝑃(𝑥) ≡ 𝑃(1) ∧ 𝑃(2) ∧ 𝑃(3) ∧ 𝑃(4), ∃𝑥 𝑃(𝑥) ≡ 𝑃(1) ∨ 𝑃(2) ∨ 𝑃(3) ∨ 𝑃(4), ∀𝑥 ~𝑃(𝑥) ≡ ~𝑃(1) ∧ ~𝑃(2) ∧ ~𝑃(3) ∧ 𝑃~(4),
∃𝑥 ~𝑃(𝑥) ≡ ~𝑃(1) ∨ ~𝑃(2) ∨ ~𝑃(3) ∨ ~𝑃(4)]

(For practice, refer Exercise problems 𝟏 – 𝟑𝟕, section 1.3, page nos : 𝟒𝟔 – 𝟒𝟗.)

Dr. SKS