Scribd
Upload
24 views3 pages

Discrete Sheet 1

This document contains a discrete structures assignment with 12 problems involving propositional logic, predicate logic, and truth tables. Students are asked to identify propositions and determine their truth values, write compound propositions as English sentences, construct truth tables for compound propositions, use truth tables to verify logical laws, translate statements into logical expressions using predicates and quantifiers, and rewrite logical statements in predicate logic.

Uploaded by

bejeb32940
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
24 views3 pages

Discrete Sheet 1

This document contains a discrete structures assignment with 12 problems involving propositional logic, predicate logic, and truth tables. Students are asked to identify propositions and determine their truth values, write compound propositions as English sentences, construct truth tables for compound propositions, use truth tables to verify logical laws, translate statements into logical expressions using predicates and quantifiers, and rewrite logical statements in predicate logic.

Uploaded by

bejeb32940
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/ 3

Alexandria University Discrete Structure

Faculty of Engineering Assigned: 8/11/2020


Computer Communication Due: 15/11/2020

1) Which of these are propositions? What are the truth values of those that are
propositions?
a) Do not pass go.
b) What time is it?
c) There are no black flies in Maine.
d) 4 + x = 5.
e) The moon is made of green cheese.
f) 2 n ≥ 100.

2) Let p, q, and r be the propositions


p : You have the flu.
q : You miss the final examination.
r : You pass the course.
Express each of these propositions as an English sentence.
a) p ∨ q
b) q → p
c) ¬q → ¬p
d) p ↔ q
e) ¬q ∨ (¬p ∧ q)

3) Construct a truth table for each of these compound propositions.


a) p → ¬p
b) p ↔ ¬p
c) (q → ¬p) ↔ (p ↔ q)

4) Use a truth table to verify the first De Morgan law


¬(p ∧ q) ≡ ¬p ∨ ¬q

5) Determine whether (¬q ∧ (p → q)) → ¬p is a tautology.

6) Let P (x) be the statement “the word x contains the letter a.” What are these
truth values?
a) P(orange)
b) P(true)
c) P(false)

7) Translate these statements into English, where R(x) is “x is a rabbit” and H (x)
is “x hops” and the domain consists of all animals.

1 Prof. Amr Elmasry


Eng. Omar Kassem
Alexandria University Discrete Structure
Faculty of Engineering Assigned: 8/11/2020
Computer Communication Due: 15/11/2020

a) ∀x(R(x) → H (x))
b) ∀x(R(x) ∧ H (x))
c) ∃x(R(x) → H (x))
d) ∃x(R(x) ∧ H (x))

8) Let C(x) be the statement “x has a cat,” let D(x) be the statement “x has a
dog,” and let F (x) be the statement “x has a ferret.” Express each of these
statements in terms of C(x), D(x), F (x), quantifiers, and logical connectives.
Let the domain consist of all students in your class.

a) A student in your class has a cat, a dog, and a ferret.


b) All students in your class have a cat, a dog, or a ferret.
c) Some students in your class have a cat and a ferret, but not a dog.
d) No student in your class has a cat, a dog, and a ferret.

9) Translate in two ways each of these statements into logical expressions using
predicates, quantifiers, and logical connectives. First, let the domain consist of
the students in your class and second, let it consist of all people.

a) Everyone in your class has a cellular phone.


b) Somebody in your class has seen a foreign movie.
c) There is a person in your class who cannot swim.

10) Express each of these system specifications using predicates, quantifiers and
logical connectives.

a) The system mailbox can be accessed by everyone in the group if the file
system is locked.
b) At least one router is functioning normally if the throughput is between 100
kbps and 500 kbps and the proxy server is not in diagnostic mode.

11) Let Q(x, y) be the statement “student x has been a contestant on quiz show
y.” Express each of these sentences in terms of Q(x, y), quantifiers, and

2 Prof. Amr Elmasry


Eng. Omar Kassem
Alexandria University Discrete Structure
Faculty of Engineering Assigned: 8/11/2020
Computer Communication Due: 15/11/2020

logical connectives, where the domain for x consists of all students at your
school and for y consists of all quiz shows on television.

a) There is a student at your school who has been a contestant on a television


quiz show.
b) No student at your school has ever been a contestant on a television quiz
show.
c) Every television quiz show has had a student from your school as a
contestant.

12) Rewrite each of these statements so that negations appear only within
predicates (that is, so that no negation is outside a quantifier or an expression
involving logical connectives).

a) ¬∃y∃xP (x, y)
b) ¬∀x∃yP (x, y)
c) ¬∃y(Q(y) ∧ ∀x¬R(x, y))

3 Prof. Amr Elmasry


Eng. Omar Kassem

You might also like