

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Material Type: Exam; Class: Mathematical Basis for Computing; Subject: Computer Engineering; University: Syracuse University; Term: Spring 2002;
Typology: Exams
1 / 2
This page cannot be seen from the preview
Don't miss anything!
CSE607: Exam-3 S-K Chin 2002 Theories with Equality Exam: 1
This is an open-book and open-notes examination. Do all problems in 80 minutes. Make sure you justify your steps using the formal inference rules to earn full credit. (This includes rewriting rules–this will help you to avoid silly mistakes). Left justify assumptions and indent goals – it makes evaluating your proofs easier.
1. (15 points) Relations and Orders (10 points for setting up the proof; 5 points for the proof)
Let R(x, y) be a relation that is
Prove there exists a case where Q(x, y) and Q(y, x)are both true.
2. (10 points) Prove the following
G1. x.y.z[(y z x z) (y )]
A3.(y x) z y (x z)
A2.x
A1.x e x
A0.x x
1
x
x e
−