Homework 1b

Nguyễn Thị Quỳnh Tâm

Ngày 21 tháng 1 năm 2024

Section 1.4
Problem 1
a) ∃x(P(x) ∧ Q(x)).
b) ∃x(P(x) ∧ ¬Q(x)).
c) ∀x(P(x) ∨ Q(x)).
d) ¬∃x(P(x) ∨ Q(x)).

Problem 10
a) ∃x(C(x) ∧ D(x) ∧ F(x)).
b) ∀x(C(x) ∧ D(x) ∨ F(x)).
c) ∃x(C(x) ∧ F(x) ∧ ¬D(x)).
d) ¬∃x(C(x) ∧ D(x) ∧ F(x)).
e) (∃xC(x) ∧ ∃xD(x) ∧ ∃xF(x)).

Problem 33
a) Let F(x) with the predicate that x is "can learn new trick" and let the domain
is" old dog". So we have original statement is ∃xF(x). The required manner as
∀x¬F(x).We can read is " All old dogs can’t learn new tricks."
b) Let G(x) with the predicate that x is " knows calculus" and let the domain
is"rabbit". So we have original statement is ¬∃xF(x). The required manner as
∃xF(x).We can read is "There is a rabbit that knows calculus."

1
c)Let D(x) with the predicate that x is "can fly" and let the domain is"birds".
So we have original statement is ∀xD(x). The required manner as ¬∃xD(x).We
can read is "There is a bird who cannot fly."
d) Let C(x) with the predicate that x is "can talk" and let the domain is"dogs".
So we have original statement is ¬∃xC(x). The required manner as ∃xC(x).We
can read is "There is a dog that talks."
e) Let R(x) and Q(x) with the predicate that x is "knows French" and "knows
Russian" and let the domain is"de people in this class". So we have original
statement is ¬∃x(R(x) ∧ Q(x)). The required manner as ∃x(R(x) ∧ Q(x)).We
can read is "There is someone in this class who knows French and Russian."

Problem 34
a) Let A(x) be “x obeys the speed limit”, the domain of discourse is "drivers".
So we have original statement is ∃x¬A(x). The negation is ∀xA(x). We can read
is “All drivers obey the speed limit.”
b) Let B(x) be “x is serious”, the domain of discourse is "Swedish movies". So
we have original statement is ∀xB(x). The negation is ∃x¬B(x).We can read is
“Some Swedish movies are not serious.”
c) Let C(x) be “x can keep a secret”, the domain of discourse is "people". So
we have original statement is ¬∃xC(x). The negation is ∃xC(x).We can read is
“Some people can keep a secret.”
d) Let D(x) be “x has a good attitude”, the domain of discourse is "s people in this
class". So we have original statement is ∃x¬D(x). The negation is∀xD(x)..We
can read is “Everyone in this class has a good attitude.”

Problem 39
a) If there is a printer that is both out of service and busy, then some job has
been lost.
b) If every printer is busy, then there is a job in the queue.
c) If there is a job that is both queued and lost, then some printer is out of
service.
d) If every printer is busy and every job is queued, then some job is lost.

Problem 46
p q p|Q
T T F
T F T
F T T
F F T

2
Problem 47
The proposition ¬(p ∧ q) is true when either p or q, or both, are false, and is
false when both p and q are true; since this was the definition of p | q, the two
are logically equivalent.

Problem 61
a) ∀x(P(x) → ¬Q(x)).
b) ∀x(R(x) → ¬S(x)).
c)∀x(¬Q(x) → S(x)).
d) ∀x(P(x) → ¬R(x)).
e) Suppose that x is a baby. Then by the first premise, x is illogical, and hence,by
the third premise, x is despised. But the second premise says that if x could
manage a crocodile, then x would not be despised. Therefore x cannot manage
a crocodile. Thus we have proved that babies cannot manage crocodiles.

Problem 62
a) ∀x(P(x) → ¬S(x)).
b) ∀x(R(x) → S(x)).
c) ∀x(Q(x) → P(x)).
d) ∀x(Q(x) → ¬R(x)).
e) Yes. If x is one of my poultry, then he is a duck (by part (c)), hence not
willing to waltz (part (a)). Since officers are always willing to waltz (part (b)),
x is not an officer.

Chứng minh.

Section 1.5
Problem 18
a) ∀f (H(f) → ∃c A(c)), where A(x) means that console x is accessible, and H(x)
means that fault condition x is happening.
b) (∀u∃m (A(m) ∧ S(u, m))) → ∀u R(u), where A(x) means that the archive
contains message x, S(x, y) means that user x sent message y , and R(x) means
that the e-mail address of user x can be retrieved.
c) (∀b∃m D(m, b)) ↔ ∃p¬C(p), where D(x, y) means that mechanism x can
detect breach y , and C(x) means that process x has been compromised.

3
d) ∀x∀y (x ̸= y → ∃p∃q (p ̸= q∧C(p, x, y)∧C(q, x, y))), where C(p, x, y) means
that path p connects endpoint x to endpoint y.
e) ∀x ((∀u K(x, u)) ↔ x = SysAdm), where K(x, y) means that person x knows
the password of user y.

Problem 34
The logical expression is asserting that the domain consists of at most two
members. Therefore any domain having one or two members will make it true,
and any domain with more than two members will make it false.

Problem 37
a) ∀x((F(x,25000) ∨ S(x,25)) → E(x)), where E(x) is "Person x qualifies as an
elite flyer in a given year", F(x, y) is "Person x flies more than y miles in a
given year" and S(x, y) is "Person x takes more than y flights in a given year"
b) ∀x(((M(x)∧T(x,3))∨(¬M(x)∧T(x, 3.5))) → Q(x)), where Q(x) is "Person x
qualifies for the marathon", M(x) is "Person x is a man", and T(x, y) is "Person
x has run the marathon in less than y hours".
c) M → ((H(60) ∨ (H(45) ∧ T)) ∧ ∀yG(B,y)), where M is the proposition "The
student received a masters degree", H(x) is "The student took at least x course
hours", T is the proposition "The student wrote a thesis", and G(x, y) is "The
person got grade x or higher in his course y".
d) ∃x ((T(x, 21) ∧ G(x, 4.0)), where T(x, y) is "Person x took more than y
credit hours" and G(x,p) is "Person x earned grade point average p".

Problem 47
¬∃x∀yP(x,y) ≡ ∀x¬∀yP(x,y) ≡ ∀x∃y¬P(x,y).

Problem 48
Blah

Problem 49
Blah

Section 1.6
Problem 11
We are asked to show that whenever p1 , p2 , ...pn aretrue, then→ r must be true,
given that we know that whenever p1 , p2 , ...pn andqaretrue, thenrmustbetrue.Sosupposethatp1 , p2 , ...pn aretrue.W

4
r is true. If q is false, then we are done, vacuously. Otherwise, q is true, so by
the validity of the given argument form, we know that r is true.

Problem 23
The error occurs in step (5), because we cannot assume, as is being done here,
that the c that makes P true is the same as the c that makes Q true.

Problem 24
Steps 3 and 5 are incorrect; simplification applies to conjunctions, not disjunc-
tions.