--1.

4:
-6: Let N (x) be the statement “x has visited North Dakota,”
where the domain consists of the students in your school.
a) ∃xN (x): There is exists students in your school who has visited North Dakota.

b) ∀xN (x) : All students in your school have visited North Dakota.

c) ¬∃xN (x):  There does not exists students in your school who has visited North
Dakota.
d) ∃x¬N (x) : There is exists students in your school who has not visited North Dakota.

e) ¬∀xN (x) :  Not all students in your school have visited North Dakota.

f) ∀x¬N (x):  All students in your school have not visited North Dakota.

-7: C(x) is “x is a comedian” and F (x) is “x is funny” and the domain consists of all
people.
a) ∀x(C(x) → F (x)) :  For all people if the person is comedian then the person is funny.
b) ∀x(C(x) ∧ F (x)) : For all people the person is comedian and the person is funny.
c) ∃x(C(x) → F (x)) :  There is exists a person that if the person is comedian then the person is
funny.
d) ∃x(C(x) ∧ F (x)): There is exists a person that the person is comedian and the person is
funny.

-10: C(x) be the statement “x has a cat,” let D(x) be the statement “x has a dog,”
and let F (x) be the statement “x has a ferret.”
a) A student in your class has a cat, a dog, and a ferret: Ǝx(C(x) ∧ D(x) ∧F(x))

b) All students in your class have a cat, a dog, or a ferret: ∀x(C(x) ∧D(x) ∨∨F(x))

c) Some student in your class has a cat and a ferret, but not a dog: Ǝx(C(x) ∧F(x) ∧~D(x))
d) No student in your class has a cat, a dog, and a ferret: ~Ǝx(C(x) ∧ D(x) ∧F(x))

e) For each of the three animals, cats, dogs, and ferrets, there is a student in your class who has
this animal as a pet: (ƎxC(x)) ∧ (ƎxD(x)) ∧ (ƎxF(x))

-16:
a) ∃x(x2 = 2) : TRUE

b) ∃x(x2 = −1) :FALSE

c) ∀x(x2 + 2 ≥ 1):TRUE

d) ∀x(x2 != x):FALSE

-39: F (p) is “Printer p is out of service,” B(p) is “Printer p is busy,” L(j ) is “Print
job j is lost,” and Q(j ) is “Print job j is queued.”
a) ∃p(F (p) ∧ B(p)) → ∃jL(j ) : If there exists a printer is out of service and it is busy, then
there exists a job is lost.

b) ∀pB(p) → ∃jQ(j ) : If all printer are busy, then there exists a job queued.
c) ∃j (Q(j ) ∧ L(j )) → ∃pF (p) :  If there exists a job is queued and lost ,then there exists a printer
is out of service.
d) (∀pB(p) ∧ ∀jQ(j )) → ∃jL(j ): If all printer are busy and all printer job is queued ,then there
exists a job is lost.
--1.5: Nested Quantifiers:
-3: Let Q(x, y) be the statement “x has sent an e-mail message to y,” where the
domain for both x and y consists of all students in your class.
a) ∃x∃yQ(x, y) There is some students in your class who has sent an email message to some
students in your class.

b) ∃x∀yQ(x, y): There is some students in your class who has sent an email message to all
students in your class.

c) ∀x∃yQ(x, y) : All students in your class who has sent an email message to some students in
your class
d) ∃y∀xQ(x, y) : There is some students in your class who has been sent a email message from
all students in your class.

e) ∀y∃xQ(x, y) : All students in your class who has been sent a email message from some
students in your class.

f ) ∀x∀yQ(x, y): All students in your class who has sent an email message to All students in your
class.

-16:
Let the domain is all students in the class, x is the student

a. Let A(x): student x is a junior. 

ƎxA(x) is true. 
b. Let B(x): student x is a computer science major.
∀xB(x) is false.
c. Let C(x): student x is a mathematics major. 
Ǝx¬(A(x)∨C(x)) is true.
d. Let D(x): student x is a sophomore major.
∀x(D(x)∨B(x)) is false.
e. Let y is the major and the domain is all major 
E(y): there is a student in the class in every year of study with major y.
ƎyE(y) is false.
-28: domain of each variable consists of all real numbers.
a) ∀x∃y(x2 = y):TRUE
b) ∀x∃y(x = y2):FALSE
c) ∃x∀y(xy = 0):TRUE
d) ∃x∃y(x + y != y + x):FALSE
e) ∀x(x != 0 → ∃y(xy = 1)) :TRUE
f ) ∃x∀y(y != 0 → xy = 1) :FALSE
g) ∀x∃y(x + y = 1):TRUE
h) ∃x∃y(x + 2y = 2 ∧ 2x + 4y = 5): FALSE
i) ∀x∃y(x + y = 2 ∧ 2x − y = 1):FALSE
j) ∀x∀y∃z(z = (x + y)/2):TRUE

-32:
a) ∃z∀y∀xT (x, y, z): ∀zƎyƎx~T(x ,y ,z)

b) ∃x∃yP (x, y) ∧ ∀x∀yQ(x, y): ∀x∀y~P(x ,y) ∨ ƎxƎy~Q(x ,y)

c) ∃x∃y(Q(x, y) ↔ Q(y, x)) : ∀x∀y(Q(x ,y) ↔~Q(y ,x))

d) ∀y∃x∃z(T (x, y, z) ∨ Q(x, y)): Ǝy∀x∀z(~T(x ,y ,z) ∧ ~Q(x ,y))

-39:
a) ∀x∀y(x2 = y2 → x = y) : x=-2,  y=2 FALSE

b) ∀x∃y(y2 = x) : x=2 FALSE

c) ∀x∀y(xy ≥ x): x=3 , y=-2 FALSE