Scribd
Upload
38 views2 pages

COMP 1000-Lab 3

This document provides instructions for several proofs involving properties of numbers and sets. It asks the reader to complete direct proofs, indirect proofs, proofs by contradiction and cases. It also involves evaluating the truth values of logical statements and rewriting logical expressions using rules like De Morgan's laws.

Uploaded by

lara Murad
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
38 views2 pages

COMP 1000-Lab 3

This document provides instructions for several proofs involving properties of numbers and sets. It asks the reader to complete direct proofs, indirect proofs, proofs by contradiction and cases. It also involves evaluating the truth values of logical statements and rewriting logical expressions using rules like De Morgan's laws.

Uploaded by

lara Murad
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
You are on page 1/ 2

COMP1000: Key Concepts in Computer Science—Lab 3

Instructions: This lab will not be graded. You do not need to submit.

1. Suppose you wish to prove a theorem of the form “if x has property A then it has property
B”.

(a) For a direct proof, what do you assume and what do you prove?
(b) For an indirect proof (by contraposition), what do you assume and what do you prove?
(c) For a proof by contradiction, what do you assume and what do you prove?

2. Use a proof by cases to show if x is an integer, then x2 + x is even.


3. Prove by contraposition (indirect proof) that if 3x2 + 2x + 1 is odd, x is even.
4. Prove by contradiction that for all real numbers x and y if x 6= y, x > 0, and y > 0, then
x y
y + x > 2.
√
5. Prove by contradiction that for each real number x, if x is irrational, then 3 x is irrational.
6- Suppose x is an element of {2, 3, 4} and y is an element of {5, 6}. Consider the following
functions:
P (x) : 2x < 4
Q(x, y) : x + y > 8
Write each of the following propositions using disjunctions, conjunctions, and negations. Then
evaluate the truth value of each proposition.

(a) ∃x P (x)
(b) ∀x ¬P (x)
(c) ∀x ∀y Q(x, y)
(d) ∃x ∀y Q(x, y)

6. Prove by using logical equivalences that ((a ∨ c) ∧ (b ∨ c)) ∨ ((c → ¬b) ∧ (c → a)) is a tautology.
(Do not forget to write the name of the rules that you apply.)
7. Let x and y be elements of {−7, −4, 2, 3}, and define P (x, y) : x − 2y > 1. What is the truth
value of the following statements?

(a) ∀x∀y P (x, y)


(b) ∀x∃y P (x, y)
(c) ∃x∀y P (x, y)
(d) ∃x∃y P (x, y)

8. Let P (x, y) be “x + 2y = xy”, where x and y are integers. Determine the truth value of the
following statements.

(a) P (−1, −1)


(b) P (0, 0)
(c) ∃y P (3, y)
(d) ∀x ∃y P (x, y)
(e) ∃x ∀y P (x, y)
(f) ∀y ∃x P (x, y)
(g) ∃y ∀x P (x, y)
(h) ¬∀x ∃y ¬P (x, y)

9. Express the following statement in predicate logic: “the absolute value of the sum of any two
integers is larger than or equal to zero.”
10. Use De Morgan’s laws to distribute negations inward (that is, all negations in the result-
ing equivalent expression should appear before a predicate). Show each step and give the
associated rule.

(a) ¬∀y∃x(∃zP (x, y, z) ∧ ∀zQ(x, y, z))


(b) ¬∀xy∃y(p(x, y) → Q(x, y))

You might also like