Scribd
Upload
48 views2 pages

Quantifiers Solution

The document provides examples of translating statements into symbolic logic forms using quantifiers and predicates. It also gives the negations of the symbolic logic statements and uses De Morgan's laws. For example: 1) It translates the statement "All dogs have fleas" into symbolic logic as "∀x D(x)" where D(x) is the predicate that x has fleas. The negation is "∃x ¬D(x)" meaning "There is a dog that does not have fleas." 2) Another example translates "There is a horse that can add" into symbolic logic as "∃x H(x)" where H(x) means x can add. The negation is

Uploaded by

marshadjafer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
48 views2 pages

Quantifiers Solution

The document provides examples of translating statements into symbolic logic forms using quantifiers and predicates. It also gives the negations of the symbolic logic statements and uses De Morgan's laws. For example: 1) It translates the statement "All dogs have fleas" into symbolic logic as "∀x D(x)" where D(x) is the predicate that x has fleas. The negation is "∃x ¬D(x)" meaning "There is a dog that does not have fleas." 2) Another example translates "There is a horse that can add" into symbolic logic as "∃x H(x)" where H(x) means x can add. The negation is

Uploaded by

marshadjafer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

EX : 1.

4
Q # 32 :
a) All dogs have fleas.
Let D(x) be the predicate that dogs have fleas where domain is the set of all dogs then the above statement
in symbolic form is
∀ x D ( x)
The negation is ¬∀ x D( x )
We use De Morgan's law so that no negation is to the left of a quantifier :
¬∀ x D( x )≡∃ x ¬D( x) There is a dog which does not have fleas. Or some dog does not have fleas.

b) There is a horse that can add.


Let H(x) be the predicate that horse can add where domain is the set of all horses then the above
statement in symbolic form is
∃ x H ( x)
The negation is ¬∃ x H ( x )
We use De Morgan's law so that no negation is to the left of a quantifier :
¬∃ x H ( x )≡∀ x ¬ H ( x ) No horse can add.

c) Every koala can climb.


Let K(x) be the predicate that koala can climb where domain is the set of all koalas then the above statement in
symbolic form is
∀ x K (x)
The negation is ¬∀ x K ( x )
We use De Morgan's law so that no negation is to the left of a quantifier :
¬∀ x K ( x )≡∃ x ¬ K ( x) There is a koala which can not climb. Or some koala can not climb.
Q # 33 : Same as Q # 32 :
a) Some old dogs can learn new tricks.
Let T(x) be the predicate that x can learn new tricks, and let the domain be old dogs.
Original is ∃x T(x).
Negation is ¬∃x T(x) ≡ ∀x ¬T(x): “No old dogs can learn new tricks.”
b) Let C(x) be the predicate that x knows calculus, and let the domain be rabbits. Original is ¬∃x C(x).
Negation is ∃x C(x): “There is a rabbit that knows calculus.”
c) Let F(x) be the predicate that x can fly, and let the domain be birds.Original is ∀x F(x).Negation is
∃x ¬F(x):“There is a bird who can not fly.”
d) LetT(x) be the predicate that x can talk, and let the domain be dogs. Original is ¬ ∃x T(x). Negation is ∃x T(x):
“There is a dog that talks.”
e) Let F(x) and R(x) be the predicates that x knows French and knows Russian, respectively, and let the domain
be people in this class.
Original is ¬∃x(F(x)∧R(x)) .Negation is ∃x(F(x)∧R(x)): “There is someone in this class who knows French and
Russian.”
CONTRAPOSITIVE
2
Prove that if n is odd then n is odd.
Contrapositive is If n is not odd then n 2 is not odd
OR If n is even then n 2 is even.
As n is even so n = 2k for some integer k
Then n 2=( 2k) 2=4k 2 =2(2k 2)=2m ; m=2k 2 , m is an integer
so n 2 is even. Proved.
CONTRADICTION
3
Prove that if n is odd then n is odd.
Given = p = n 3 is odd
To prove = q = n is odd
Suppose that q is false that is n is not odd or n is even then n = 2k for some integer k
3 3 3 3 3
Then n =( 2k) =8k =2( 4k )=2m ; m=4k , m is an integer
So n 3 is even but given that n 3 is odd we get a contradiction.This contradiction proves that q was not
false so n is odd. Proved.

You might also like