Handout #25
CS103
April 19, 2011
Robert Plummer
CS103 Review Session Problems
Here are the problems from the review sessions on Tuesday.
Solutions are also posted on
CourseWork.
Logic
Give a formal proof for the following.
Use numbered steps and refer to those numbers in
the justification you give for each step.
1.
¬
x (R(x)
S(x))
2.
y (S(y)
M(y)
L(y))
x (R(x)
(L(x)
M(x)))
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
2
Translations
4.
Translate each of the following sentences into firstorder logic. The questions describe
events occurring at a Halloween party. The domain of discourse includes exactly the
people who attended the party. You may only use the following predicates:
M(x)
x wore a mask to the party.
S(x, y)
x scared y at the party.
F(x, y)
x and y are friends
Notes:
F should be considered to be symmetric, i.e. F(x, y)
F(y, x).
It is possible to scare yourself.
It is possible to be friends with yourself.
1) Nobody who didn’t wear a mask scared a friend.
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '11
 PLUMMER
 Equivalence relation, Binary relation, Transitive relation, Firstorder logic, Billy

Click to edit the document details