0% found this document useful (0 votes)
13 views25 pages

DM Assignment 1 Questions

The document contains exercises related to propositional logic, including the formulation of propositions using logical connectives, truth tables, and determining the truth values of conditional statements. It also includes logical puzzles and reasoning problems involving statements made by characters in hypothetical scenarios. The exercises aim to enhance understanding of logical expressions and their relationships.

Uploaded by

sanjukh4581
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
0% found this document useful (0 votes)
13 views25 pages

DM Assignment 1 Questions

The document contains exercises related to propositional logic, including the formulation of propositions using logical connectives, truth tables, and determining the truth values of conditional statements. It also includes logical puzzles and reasoning problems involving statements made by characters in hypothetical scenarios. The exercises aim to enhance understanding of logical expressions and their relationships.

Uploaded by

sanjukh4581
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

7.

Let pand q be the propositions c) To get a


p:It is bclow freezing. an A on
q:I is snowing. d) You get
Write these propositions using p and q and logical ercise i
conncctives. class.
d sunny.
A) Itis below freezing and snowing. e) Getting
this bo
b) It is below freezing but not snowing. f) You w
c) Itis notbelow freczing and it is not snowing. do eve
sanErglishs e n t e n e , d) It iseither snowing or below freezing (or both). final.
e) If it is below freczing, it is also snowing.
n It is either below freezing or it is snowing, but it is not 11. Let p, q,
snowing if it isbelow freezing. P:C
New g) That it is below freczing is necessary and sufficient q:
at the r:E
immng
for it to be snowing.
conm (8.)Let p. q, and r be the propositions Write the
a t ofchese connecti"
p: You have the flu.
q: You miss the final examination. a) Berri
not b
r:You pass the course.
b) Griz:
Express each of these propositions as an English sentence. ing
a) p’9 b) 9 >r trail.
c) q pot d) pvqvr c) If be
e) (p ’ r)v(q ’ )
) (pAq) v(qAr) only
d) It is
husets, wzs an only 9. Let p and q be the propositions not
otential. His formal p:You dive over 65 miles per hour. are
isty. He received a q:You get aspeeding ticket. e) For
University, changing Write these propositions using p and q and logical not
Tinceton in 1939 for connectives.
ano
ton. With the start of a) You do not drive over 65 miles per hour. are
ngin statistics. Tukey b) You drive over 65 miles per hour, but you do not get
ns with his skills. In f) Hi
a speeding ticket. ha
ment Pinceton as c) You will get a speeding ticket if you drive over 65
mes. Tukey founded miles per hour.o al th
ions to many areas d) If you donot drive over 65 miles per hour, then you 12, Deter
he values of aset of a) 2
willnot get a speeding ticket.
vention, with J. W. e) Driving over 65 miles per hour is sufficient for getting b) 1 -
sSilled wordsmith; a speeding ticket. c) 1-
d) 0
.He chaired several ) You get a speeding ticket, but you do not drive over 13. Deter
ved on committees 65 miles per hour. is true
8 Whenever you get a speeding ticket, you are driving a) If
over 65 miles per hour. io0 e b) If
nd bigit, that 10Letp. q, and r be the propositions exam.bnos c) IE
ord. For an never o d) If
account P: You get an A on the final
9: Youdo every exercise in this book. (
1.1 Propositional Logic 17

r: You get an A in this class.


these propositions using p, g, and r and logical
Write
connectives.
not do every
a) You get an A in this class, but you do
exercise in this book.
Youget an A on the final, you do every exercise in this
b)
book,and you get an A in this class.
c) Toget an A in this class, it is necessary for you to get
an A onthe final.
d) You get an A on the final, but you don't do every ex
ercise in this book;nevertheless, you get an A in this
class.
e) Getting an A onthe final and doing every exercise in
this book is sufficient for getting an A in this class.
) You will get an A in this class if and only if you either
doevery exercise in this book or you get an A on the
final.
propositionso
1l. Let p, 4, and r be the
p:Grizzly bears have been seen in the area.
q:Hiking is safe on the trail.
r:Berries are ripe along the trail.
are ripc.
q and logical e) For hiking on the trail to be safe, it is necessary but
not sufficient that berries not be ripe along the trail
and for grizzly bears not to have been seen in the
area.
ou do not get
) Hiking is not safe on the trail whenever grizzly bears
Hrive over 65 have been seen in the area and berries are ripe along
the trail.
bur, then you / 12.) Determine whether these biconditionals are true or
12) etermine
2+2 = 4 if and only if 1+ 1=2.
false.
nt for getting b) 1+1=2 if and only if2 +3 = 4.
c) 1+1 =3if and only if monkeys can fly.
t drive over d) 0 > 1 if and only if 2 > 1.
13. Determine whether each of these
conditional statements
are driving is true or false.
a) If 1+1=2, then 2 +2=5.
b) If 1 1=3, then 2+ 2 =4.
If1+1 =3, thén 2 +2 =5. E
d) If monkeys can fly, then 1+1=3.sn sa
18 1/The Foundations: Logicand Proofs

114Determincwhether each of these conditional statements


is true or false.
a) If 1+1=3, then unicorns exist.
b) If 1 +1=3,then dogs can fly.
c) If 1+1=2, then dogs can fly.
d) If 2 +2= 4, then 1 +2=3.
15. For each of these sentences, determine whether an inclu
sive or or anexclusive or is intended. Explain your answer.
a) Coffee or tea comes with dinner.
b) A password must have at least three digits or be at 20.
of each of c) (pAq) Vr d) (p ) Ar
e) (p v q) A r ) (pA q) V r
33. Construct a truth table for cach of these compound
mmer day.
propositions.
sleep until
a) p ’ (-qVr) b) ¬p ’ (q ’ r)
eh of these c) (p’ q) v(-p’r) d) (p ’ q) A(Gp’ r)
e) (p )v(g r)
Vs)
34.)Construct atruth table for ((p -’ ) ’ ) ’ s .
Construct a truth table for (p + ) r > s).
(r
h of these 36. What is the value of x after each of these statements is
encountered ina computer program, if x =lbefore the
statement is reached?
a) if 1+2=3then x:= x+1
b) if(1 +1=3) OR (2 + 2 =3) thenx=x+1
c) if (2 +3= 5)AND(3+ 4 =7) then x:=x+1
Compound d) if(1 +1=2) XOR (1 +2=3) then x=X+1
e) ifx <2thenxi=x+1
37, Findthe bitwise OR, bitwise AND, and bitwise XORof
each of these pairs of bit strings.
a) 101 1110, 010 0001 b) 11| 0000, 10101010
1-21

address youin the ways described. If you cannot determine 63. A detective ha
what these two people are, can you draw any conclusions? From the stori
Asays Atleast one of us is a knave and B says nothing. cluded that if
cook;the cook
56. 14 says "The two of us are both knights" and B says "A
is a knave." truth; the gard
and if the har
57, A says "I am a knave or B is a knight" and B says nothing.
lying. For eac
58 Both A and B say I amn a knight." termine whet
59. Asays "We are both knaves" and B says nothing. Explain your
Exercises 60-65 are puzzles that can be solved by translat 644 Fourfriends
ing statements into logical exxpressions and reasoning fromn thorized acce
these expressions using truth tables. statements tu
60.)The police have three suspects for the murder of Mr. "Carlos did i
Cooper: Mr. Smith, Mr. Jones, and Mr. Williams. Smith, "Diana did it
Jones, and Williams each declare that they did not kill Idid it."
Cooper. Smith also states that Cooper was a friend a) If the auth
of Jones and that Williams disliked him. Jones also states
suspects
reasoning
that he did not knowCooper and that he was outof town b) If the aut
saw
the dayCooper was killed, Williams also states that he
of the killing
who did
both
and B says A Unen sO 1s the
cook; the cook and thegardener cannot
truth; thc gardener and the handyman both be telling the
says nothing. and if the handyman is telling the truthare not both lying:
lying. For each of the four witnesses, can the then the cook is
termine whether that person is telling the truth detective de
bthing. or lying?
dby translat Explain your reasoning.
644 Four friends have been identified as
asoning from suspects for an unau
thorized access into acomputer system. They have
statements to
made
arder of Mr. the investigating authorities. Alice
"Carlos did it." John said I did not do it." Carlos said said
ams. Smith,
did not kill Diana did it." Diana said "Carlos lied when he said that
I did it."
as a friend
a) If the authorities also know that exactly one of the four
es also statesiiFAE suspects is telling the truth, who did it? Explain your
out of town
sthat he saw reasoning.irist drt sia obizrcob
b) If the authorities also know that exactly one is lying,
fthe killing who did it? Explain your reasoning.
ed him. Can 65. Solve this famous logic puzzle, attributed to
Albert
Einstein, and known as the zebra puzzle.Five men wvith
n0cent men
different nationalities and with different jobs ive in con
f the guilty secutive houses on a street. These houses are painted
different colors. The men have different pets and have dif
1-28
les is a tautology, IWe will study
Igornithms. questions Such as this in
1

se De Morgan's laws to find the


tollowing statements. negation of cach of the
a) Kwame will take a job in
school. industry or go to graduate
b) Yoshiko knows Java and calculus.
c) Jamces is young and strong.
d) Rita will move to Oregon or
9. Show that each of these
Washington.
conditional statements is a tau
tology by using truth tables.
a) (pA9)’pnta b) p’PV)
c) p’ (p ’ q) d) (pA ) ’ (p )
e) -(p ’ )’ p ) (p ’ )’ q
(10.)Show that each of these conditional statements is a tau
tology by using truth tables.
a) -pA(pV )]>4
the b) [(p’ q) A(q ’ )] ’ (p’r)
c) [pa(p ’ q)]’q
d) ((p vq) A
(p ’ r) A(q’ r)] ’r
11. Show that each conditional statement in Exercise 9 is a
tautology without using truth tables.
12.)$how that each conditional statement in Exercise 10 is a
autology without using truth tables.

1883-1964) Henry Maurice Sheffer, born to Jewish parentsinthe tudied


1-29
1-28
the absorption laws.
to verify
truthtables 34. Find the dual of e
as this in 13. a)
Usepv(pAg)= p b) pa(p V)=p
a) pvy
1Reemine
whether ("PAP ’ )) q is a c) (p ^~) v(g
Mautology. 35. Find the dual of
whether e
Detemine ("9A (P ’ 9) -’p is a
ach of the IS. a) pA ¬y^r
tautology. c) (pvF) A(q
Each of Exercises 16-28 asks you to show that two com- 36. When does s*=
graduate ound propositions are logically equivalent. To do this, ei-
ther show that both sides are true, or that both sides are
37. Show that (s*)" =
38. Show that the logi
alse. for cxactly the same combinations of truth values of the double negatio
the propositional variables in these expressions (whichever contains compoun
Satau is easier). other.
16.`how that p q and (pAq) v(pA¬) are **39, Why are the duals
equivalent. tions also equivaler
9) 17. Show that p> q) and p > ¬9 are logically contain only the op
equivalent. 40. Finda compound
a tau variablesp, q, and
18 Showthat p -’ qand q ’ ¬p are logically equivalent. ris false, but is fals
19. Show that p qand p q are logically equivalent. of each propositior
AU Show that -(p D q) and p q are logically equivalent. 41. Finda compound
H. Show that ¬(p ) and p q are logically variables p, q, and
equivalent. and r are true and
is a 22. Show that (p ’ )ap ’ junction of conjun
n) and p ’ (q ^r) are log combination of val
ically equivalent. tion is true. Each c
is a
23. Show that (p ’r)a(g ’ ) and (p Vq) ’ r are log three propositional
ically equivalent. LS42. Suppose that a trut
24. Show that (p )
v(p ’ ) andp’ (q Vr) are log specified. Show th
ically equivalent.ciletee truth table can be fo
Z3. Show that (p )V(g ’ ) and (p Aq) r are log junctions of the vari
ically equivalent.e junction included f
the compound pro
the 20.|Show that ¬p ’ (q’r) and q’ (p Vr) are logically pound proposition
ied equivalent. form.
ree 21. Show that p q and (p ’ ) A(q ’ p) are logically
cquivalent. Acollection of logical
ral
plete if every compou
es, 20. Show that p qand ¬p -qare logically equivalent. to a compound propos
ll, 23, Show that (p ’ ) a -’ )-’ (p ’r) is a tautol erators.
he
til 43. Show that ¬, A, an
30. how that (pV 4q) A
(-pvr) (q Vr) is a tautology. lection of logical
25
3: Show that (p ’ ) ’ r andp’
logically equivalent. (4’) are not ery compound prop
a alo in disjunctive norm
32. Show that (p Ag) ’rand (p -’ )A(g-’) are not
*44. Show that ¬ and
d, logically equivalent. lection of logical
dirccl
57. The following
system: "If the state, if
the system
under.
There
closcd
bothpand
putin s p e c i f i c a t i o n is hard to
a
telephonc

ralse when monitor is Find In this


then the
bothp
state." This c o n d i t i o n a l
statements.
uhen
NOR is true initial
otherwise. The propsitions not inits it involvestwo specification
that in howpredic
because
and p
enoted by plq Sheffer
stand c a s i e r - t 0 - u

conditional
n d e r s t a n d

computer s
are called the an cquivalent, negations but not
nd S. disjunctions and predicate 1
ter H. M.Shefier and C. volves
qVr, notion of q
pVg, "p Vq, true
statements.

disjurctions
logical oneratar NAND.
58/ Howmany of the can be made
simultaneously
objects of :
quivalent to pAq). q v , and g V g, and r?
of truth values to p,
logical operator NOR. by an assignment
p V gVs, p V rVs,
Predica
quivalent to Vc). of the disjunctions
59. How many qVr V S,q V r V S ,
that (!) is a functionally V ¬s, pVqV S,
-pV
VrVs, and p vr V¬s can be made Statement
operators. -pVq V ¬s, p
simultaneously true by an assignment of
truth values to "x >
ycquivalcnt to-p.
-) is logically cquivaient to P, 9, r, and s? "com
(b). and Exercise 49. that Acompound proposition is satisfiable if there is an assign and
tof truth values to the variables in the compound propo "com
lete collection of iogical
Sition that makes the compound proposition true.o are often
K0. Which of these compound propositions are satisfiable?
gically equivalent 1o p ’ statement
. (pvqv-r)a(pV~qV¬s) A(p Vr V ¬s) ^ will discL
mplete coliection of iog (-pv-gV ¬s) ^(p Vqv¬s)
b) (-pv~qvr)a-pvqvs) A(pv The
ivalent. (-pvorV ¬s) A
(p VqVr) A(p
qv¬s)A statemen
c) (pv4 Vr)a(pv
¬qVs) VVs) the stater
rare not equivalent, so A(g v r Vs) ^
ssociative. ("pvrv s) A(-pv qv¬s) A(pV -g the predi
(-py
of compound proposi- 61. Explain ~4V s) ^(-p V¬r V¬s)
V )A
how an the prop
ppositional variables p algorithm for becomes
thet
statements
animals as a pet.
x = x'" If the domain Con- ncgations,
11. Pr) be the statement
Let the truth values? a) BxP(x
sists of the integers, what are c) Yx((x
hours b) P(1) c) P(2)
a) P(0) e) Bx(
nsists e) Bx P(«) f) YxP(x)
d) P(-1) 21. For each
ns in
the statement "x +1> 2x." If the domain
12) Let Q«) be values? statemen
consists of all integers,
what are these truth false.
b) Q(-1) c) Q1)
a) Q(0) a) Ever
e) V r 0 ( r ) )B-0)
d) Bx Qr) b) Eve
ota," g) VxnQr) c) Eve
statements if
hool. value of each of these
13. Determine the
truth d) No
of all integers.
the domain consists
n) b) Bn(2n = 3n) 22. For ea
a) Vn(n +1>
iou d) Vn(n'> n)statements if
statem
c) Bn(n=-n) false.
Determine the truth value
of each of these
is 2 6 a) E
domain consists of all real numbers.lo
main he ab) x(r < ) o b) T
a) Bx(x=-1) ) o c) E
) Yx((-) =) d) Vx(2x> d) S
students at your school. P ) consists of the integers 3, and 4.

school who can speak Rus cach of these propositions using disjunctions, conjunc
+. tions, and negations.
schoolwho can speak Rus a) BrP() b) Vx P«) c) x-Px)
w C++. d) P(r) e) rP(*) f) - P ( )
oleither can speak Russian 18.Suppose that the domain of the propositional function
P(r)consists of the integers -2, -1, 0, 1, and 2. Write
can speak Russian or knows out each of these propositions using disjunctions, con
junctions, and negations.
has a cat." let D(a) be the c) JxP(x)
a) rP(«) b) VxP(x)
et F()be the statement "x e) -xP(x) f) ¬xP(x)
f these statements in terms d) Vr¬P(x)
ers, and logical connectives. 19. Suppose that the domain of the propositional function
students in your class. P(«) consists of the integers 1, 2, 3, 4, and 5. Express
these statements without using quantifiers, instead using
acat, a dog. and a ferret.
ave a cat, a dog.or a ferret. only negations, disjunctions, and conjunctions.
s has a cat and a ferret, but a) rP(*) b) YxP)
c) - rP(r) d) -x P(x)
2s a cat, a dog, and a ferret. e) x((x #3) -’ P(r)) VJx¬P(r)
nals, cats, dogs, and ferrets, 20.) Suppose that the domain of the propositional function
class who has one of these Pr) consists of -5, -3, -1, 1, 3, and 5. Express these
statements without using quantifiers, instead using only
="If the domain con ncgations, disjunctions, and conjunctions.
the truth values? a) Bx P(x) b) VxPx)
c) P2) c) Vx(x#1)’ P(x) d) Br((r >0) AP)
x) f) xPK) e) Bx(-P(x)) AV(x < 0) -’ P())
the which the
consistofalpeoj
ain c) Everythill

correct
place 35. Find a c
condition,

the but it is quantifie


is in
spcak Hindi.

place,
in
Nothing
correct consists
riendly. hom d) the
was not
is not in
c o n d i t i o n .

who
Class
vour tools a) x(
of
c) One
operators,.

becen in a
movic.
iogc
inexcellent condition.

using
logical c) Yx
coursc in statements
taken a
s
Express cach ofthese 36. Find a
into iog
29. predicates, and quantifiers.
quanti
statements tautologies.
hesc
and iogica
are tautology. consis
contradiction isa
propositions
quantitiens,
a) Some
S,
nconsiSt o
the
students
The negation of a can be a a)
b) contingencies
of two
consist of all peopic.
c) The
disjunction c) Y.
ecelular phonc. tautology. tautology. 37. Expr
sOCT aforeign
moVIC.
of twotautologies is a
The conjunction quan
ess wto cannot SWIm
domain of thepropositional function P(*, y)
Juppose the
ss cat solve quadratic 30. consists of pairs x and y, where x is 1, 2,
or 3 and yis a)

ics not ant to t ICh. 1,2, or 3.Write out these propositions using disjunctions
sinto iogical expressios and conjunctions.
b)
I iogical conectives. a) Bx P, 3) b) VyP(1, y)
c) By-P(2, y) d) Vx¬P(*, 2)
31. Suppose that the domain of Q,y, z) consists of triples
perfect.
A, y, z, where x= 0, 1, or 2, y=0or 1, and z =0or l. c)
perfect. Write out these propositions using disjunctions and
nd or soneone is ot junctions. con
a) VyQ0, y, 0)
nts C) 37 b) rQ(N, 1, 1)
1-49

40. Express
34. Express the negation of these propositions using quanti- cates, qu
iers, and then express the negation in English. a) Whe
a) Some drivers do not obey the speed limit. disk
b) AllSwedish movies are serious. b) No
c) No one can keep a secret. no

There is someone in this class who does not have a


d) det
good attitude. c) Th
counterexample, if possible, to these universally cur
35. Find a the domain for all variables d) Vie
quantified statements, where
lea
consists of allintegers. b) Vx(r> 0vr<0) ne
a) Vx(* x) 41. Expr
c) Vx(x=1) cates
universally
counterexample, if possible, to these variables
So. Find a wherethe
domainfor all a) A
25. Translate cach of these nested quantifications into an En c) V
glish statement that expresses a mathematical fact. The d)
domain in cach case consists of allreal numbers. 32. Exp
a) Bxy(xy =y) all n
b) Vay((« < 0) A(y <0) ’ (xy > 0)) a)
c) Brly((x' > y) A(r < y)) b)
d) Vxtyz(x + y=) c)
d)
26) Let Qx, y) be the statement "x +y=xy" If the
domain for both variables consists of all integers, what 33. Re
pea
are the truth values?
is
a) 0(1, 1) b) Q(2, 0) c) Vy(1, y)
CoT
d) Bx0(x, 2) e) Bxy Qu, y) f) Vxy 0x, y)
g) By¥xQr, y) h) Vydx (x, y) i) Vxy2,y) a)
27. Determine the truth value of each of these statements if c)
the domain for all variables consists of all integers. d)
b) Bn(n < m²) e)
a) VnBm(n < m)
c) YnBm(n + m=0) d) BnVm(nm = m) 34. Fi
e) BnSm(n² + m² 5) ) SnSm(n?+ m?= 6) fo
g) BnSm(n + m=4^n -m = 1) (z
h)
1.4 Nested Quantifiers 61

wo positive integers is positive. 23 Determine the truth value of each of these statements
two negative integers is not neces if the domain of each variable consists of all real
numbers.
eof the sum of two integers does not a) Vxy(r?= y) b) xy(x = y)
he absolute values of these integers. c) Bxy(xy = 0) d) Bxy(x + y y + x)
ntifiers, logical connectives, and e) Vx(x #0’y(xy = 1))
rs to express the statement that f) Bxy(y #0’ xy = 1)
is the sum of the squares of four g) Vxy(x +y= 1)
h) Jxy(x + 2y = 2^ 2x + 4y = 5)
iers, logical connectives, and math i) Vxly(r +y =2A 2x - y = 1)
xpress the statement that there is a ) Vxydz(z = (x + y)/2)
not the sum of three squares. 29. Suppose the domain of the propositional function P(*, y)
e mathematical statements using consists of pairs x and y, where x is 1, 2, or 3 and y is
logical connectives, and mathe 1, 2, or 3. Write out these propositions using disjunctions
and conjunctions.
a) VryP(*, y) b) xy P(x, y)
negative real numbers is positive. c) BxyPx,y) d) yx P(x,v)
real number and itself is zero.
number has exactly two square 30. Rewrite each of these statements so that negations ap
ear only within predicates (that is, so that no negation
nber does not have a square root is outside a quantifier or an expression involving logical
connectives).
nested quantifications into an En a) -yx P(x, y) b) ¬ryP(x. y)
oresses a mathematical fact, The c) -3y(Qy) AV¬R(a, y))
asists of all real numbers. d) ¬y(axR(x, y)v VrSu, y))
e) dy(x3zT(x, y,z) v arVzU(r, y, ))
31. Expressthe negations of each of these statements so that
ifiers, and in English. nathernatics. b)
Every student in this class likes seen a Yxy(P
a) class who has never
Thereis a student in this
same nc
b)
computer. every Astatement i
There is a student in this class who has takcn
e)
mathematics course offered at
this school. if it is of the f
class who hasbeen in at least
d) There is astudent in this
one room of every building on campuS.
universally where each
39. Find a counterexample, if possible, to these variables
quantified statements, where the domain for all quantifier or
consists of all integers. is a predica
a) Vrvy(x? = y2 ’x= y) ary(Pa.
b) Vy(y² ) c) Vxy(xy x) Bx P(x)v
40, Find a counterexample, if possible, to these universally occur first).
quantified statements, where the domain for all variables Every s
consists of all integers. predicates, T
a) Vxdy(x= 1/y) b) Yxly(y² -x<100) tifiers is equ
c) VrVyr' y') Exercise 51
41. Use quantifiers to express the associative law for multi- *50. Put these
plication of real numbers. logical ec
Table 2 in
|-62
1-6
distributive laws of multi-
quantifiers to express
the
omain for 42. Use numbers.
addition for real
plication over
logical connectives to express the
43. Use quantifiers and polynomial of
ers. Then polynomial (that is,
gation is fact that every linear where the coefficient
degree 1) with real coefficients and
gation in
one real root.
"It is not of xis nonzero, has exactly
express the fact
44)Use quantifiers and logical connectives to coefficients
lars play that a quadratic polynomial with real number
has at most two real roots.
atted with 45. Determine the truth value of the statement xy(Iy = 1)
if the domain for the variables consists of
xactly two a) the nonzero real numbers.
b) the nonzero integers.
this book.
e in every
the positive real numbers.
46, Betermine the truth value of the statement ry(r<y)
if the domain for the variables consists of
iers. Then
egation is a) the positive real numbers.
egation in b) the integers.
"It is not c) thenonzero real numbers.
47. Show that the two statements
-ry P(x, v) and
actly two VayPa, y), where both quantifiers over the first
variable in P(a, y) have the same domain,
rkdexcept quantifiers over the second variable in Pr, v)and both
have the
same domnain, are logically equivalent.
"Tofu is healthy
not
t Youdo not cattofu."Cheeseburgers are
healthy to cat."
I am not 15. F
dreaming orhallucinating."
am either
,» IfIam hallucinating, Isee elephants run
dreaming." a

ning down the road."


the argument form with premises P1,
Show that
11.
and conclusion g ’ris valid if the argument b
Pn
P2 . , Prs 4, and conclusion r
form with premises P1 P2,
ys valid.
argument form with premises (p At) c
12. Showthat the
(u^t), u ’ p, and S and conclusion
(rVs), q ’ and then using
first using Exercise 11 d
q’ris valid by
inference from Table 1 . 1 T 9 t s t
rules of
a student in this class, can use a herefore, Zeke,
good for the United word
aited States is good gram." processing pro
rations is for you to d) "Everyone in NewJersey lives within 50
ocean. Someone in New Jersey has never miles of the
seen the
Mice are rodents." ocean. Therefore, someone who lives within 50 miles
of the ocean has never seen the
Bats are not ro ocean."
14. For each of these arguments, explain
which rules of in
at relevant conclu
Ference are used for each step.
a) "Linda, a student in this class., owns a red
ain the rules of in convertible.
rom the premises. Everyone who owns a red convertible has gotten at
least one speeding ticket. Therefore, someone in this
the next day." "I class has gotten a speeding ticket."
did not use the b) "Each of five roommates, Melissa, Aaron, Ralph, Ve
neesha, and Keeshawn, has taken a course in discrete
unny."I worked mathematics. Every student who has taken a course in
Itwas not sunny discrete mathematics can take a course in algorithms.
won Friday." Therefore, all five roommates can take a course in al
ies are insects." gorithms next year:'"
ders eat dragon c) All movies produced by John Sayles are wonder
ful. John Sayles produced a movie about coal min
"Homer does ers. Therefore, there is a wonderful movie about coal
ehas an Internet miners."
d) "There is someone in this class who has been to
not taste good." France. Everyone who goes to France visits the Lou
eat what tastes vre. Therefore, someone in this class has visited the
burgers are not Louvre."

15. For each of these arguments determine whether the argu


/The oundations: Logic and Proofs

I6reach ofthese arguments determine whether the argu 6. P


ment is eomect or incorect and explain why. 7. I
a) Everyone enrolled in the university has lived in a
dorf(24.) dent
mitory. Mia has never lived in adormitory. Therefore.
pose
Mia is not enrolled in the university.
b) A convertible car is fun to drive. Isaac's car is
not
convertible. Therefore, Isaac's car is not fun to drive.a 1.
c) Quincy likes all action movies. Quincy likes the 2. I
movie
Eight Men Out. Therefore, Eight Men Out is an action 3.
movic. 4.
d) Alllobstermen set at least a dozen traps. 5. (
Hamilton is a
lobsterman. Therefore, Hamilton sets at least a dozen 6.
traps. 7.
17. What is wrong with this argument? Let H(X) be "x is 25. Just
happy." Given the premise Bx H(x), we conclude that the
H(Lola). Therefore, Lola is happy. ular
18.)What is wrong with this argument? Let S(x, y) be x is 26. Just
shorterthan y." Given the premise s S(s, Max), it follows that
that S(Max, Max). Then by existential generalization it ther
follows that x S(x, x), so that someone is shorter than qua
himself. 27. Us
19. Determine whether each of these arguments is valid. If an S(
argument is correct, what rule of inference is being used? S(
If it is not, what logical error occurs? 28.)Use
a) If nis a real number such that n > 1, then n > 1.
Suppose that n² > 1. Then n>1.
b) Ifn is areal number with n> 3,then n all
> 9. Suppose 29, Use
that n <9. Then n<3.
c) Ifn is a real number with n > 2, then n
> 4. Suppose
that n< 2. Then n' <4. are

20.\Determine whether these are valid arguments. 30. Use


a) Ifx is a positive real number, or !
then x is a positive real is
number. Therefore, if a' is positive,
number, then a is a positive real where a is a real Da
b) if x #0, where x is a number. 31. Us
a be areal number real number, then x #0.
with a² # 0; then a#0. Let ing
21. Which rules of her
inference are used to
cOnclusion of Lewis Carroll's establish the Or
Example 26 of Section 1.3? argumnent described in get
22., Whie
1-74
1-75

Conjunction from (3) and (5)


rgu 6. Pc)A Oic)
Existential generalization mine
7. Br(P)A Q)) of the
or errors in this argument that sup
24)Ndentify the eror a) Th
dorf
that if Vx(P(*) VQ«)) is true then lo
fore. Osodly shows
VP) v Vrx)is true. b) Th
Premise no
not a 1. Vr(P(r)v Qr)) c) T
Iive. 2. P(c) V c) Universal instantiation from (1)
d) T
Simplification fromn (2)
novie 3. P(c) Universal generalization from (3)
e) T
ction 4. Yr P(r) e
Simplification from (2)
S. Q(c) otolo
nis a 6. Vx0«) o Universal generalization from (5) 1.6
0zen
7. Vx(P(r) v VxQx)) Conjunction from (4) and (6)
25. Justify the rule of universal modus tollens by showing that Intr
x is
the premises Vx(P(«)’ 0u)) and -Qa) for a partic
that
ular element a in the domain, imply ¬P(a). In thÉ
26. Justify the rule of universal transitivity, which states a val
Ows
that if Vx(Pa)’ Q)) and Vx(0r)’ R(«)) are true, the t
n it
then Vx(P(r)’ R)) is true, where the domains of all and
quantifiers are the same.
han
27. Use rules of inferenceto show that ifVx(P(r) ’ (Qu)A we i
S()) and Vx(P(x) A R()) are true, then Vx(R(«) A
fan true
ed?
Sr))is true.
28.)Use rules of inference to show that if Vx(P(x) V How
Qx)) and Vx((¬P(x) A Qx)) ’ R(x)) are true, then of th
1. of in
Yr(-R(*)’ P)) is alsà true, where the domains of
all quantifiers are the same. rules
Ose
29. Use rules of inference to show that if Vx(P(r) vQ)). are t

Ose
Yx(¬0x) VS«), Vx(R(*) ’¬S(), and r-P)
are true, then Bx-R(«) is true. mat)
30. Use resolution to show the hypotheses "Allen is a bad boy veri
real
or Hillary is a good girl" and "Allen is a good boy or David ence
is happy" imply the conclusion d girl or und
of two odd integers
18, Prove that if nis an integer and 3n
mof two even inte +2 is even, then n is
evenusing
a) a proof by contraposition.
ris an even numlr b) aproof by contradiction.
19. Prove the proposition P(0), where P(n) is
ative, of an even "Ifn is a positive integer grcater than 1,the proposition
then n'>n."
ct prof. What kind of proof did you usc?
n integers, where20.rove the proposition P(1), where P(n) is the proposi
Cven. What kind tion "If nis a positive integer, then n > n"What kind of
proof did you use?
Nuct of two odd 21. Let P(n) be the proposition "If a and
b are positive real
numbers, then (a + by > a" + b" Prove that P(1) is
id integer is the true. What kind of proof did you use?
22. Showthat if you pick three socks from a
ing just blue socks and black socks, you mustdrawer contain
nn+2 is not a
pair of blue socks or a pair of black socks. get either a
at the sum of an 23. Show that at least 10 of any 64
days chosen must fall on
is irational. the same day of the week.
tof two rational 24. Show that at least 3 of any 25 days chosen must fall in
same month of the year. the
irational num 25. Usea proof by contradiction to show that there is no ratio
nal number r for which r+rt1=0.
that r =
[Hint: Assume
aonzero rational a/b is a root, wherea and b are integers and a/b
onal. is in lowest terms. Obtain an equation involving
rational. by multiplying by b'. Then look at whether a integers
cach odd or even.] and b are
1/x is rational.
at if x+ y >2, Prove that if n is a positive integer, then n is
only if 7n +4 is even. even if and
: lory> 1. 27. Prove that if nis apositive
is even, then m integer, then n is odd if and
only if 5n +6 is odd.
28.)Prove that m²=n'if and only if m
odd, thenn is 29. Prove or disprove that if =n or m=-n.
mn = 1, then either m= ml and n are integers such that
and n -1. and n =l, or else m = 1
30. Show that these
aand b are real three statements are cquivalent, where
numbers: (i) a is less than b,
(i) the
86 1/The Foundations: Logic and Proofs

average of aandb is greater than a, and (üi) the average 36. Show th
of aandb is less than b. to be eq
31. Showthat these statements about the integer x are equiv
lent: (i) 3x + 2 is even, (ii) x +5 is odd, (iii) x* is even. 37. Show t
32. Showthat these statements about the real number x are shown
cquivalent: () x is rational, (ii) x/2 is rational, and (ii) statem

3x - 1isrational. Ps ’
33. Show that these statements about the real number x are 38. Finda
equivalent: (i) x is irational, (ii) 3x + 2is irrational, (iii) intege
x/2 is irrational. intege
39, Prove
34. Is this reasoning for finding the solutions of the equation
/2x2-1=xcorrect? (1) V2r? -l=xis given; (2) is grea
What
2x2-1= , obtained by squaring both sides of (1);(3)
40. UseE
x?-l=0, obtained by subtracting x² from both sides
of (2); (4)(x- 1)(x + 1) =0, obtained by factoring the gers a
ational, (iii) integer
integers. can
numbers aj, az,....a
39, Provethat at least one of the real up
he equation than or cqual to the average of these numbers
is greater stat
s given: (2) use?
What kind of proof did you to
es of (1); (3) Exercise 39 to show that if the first 10 positive inte. in
m both sides 40. Use any order, there exist
around a circle, in
Tactoring the gers are placed locations around the circle
in consecutive
1, which fol three integers E
than or equal to 17.
=0. that have a sum greater four statements are
is an integer, these
of Va+3= 41. Prove that if n odd, (iiü) 3n + 1 is
wen: (2)x+ equivalent: (i) n is even, (ii) n + l is
oth sides of odd, (iv) 3n is even. are
these four statements about the integer n
btractingx+ (42: Prove that even, (iii) n' is odd.
equivalent: (i) n² is odd, (i)1-n is
-1)(x 6),
side of 3); (iv) n²+ lis even.
(4) because

d Strategy

You might also like