Faculty of Engineering

Cairo University
MTH N104, MTH 125B

Discrete Math
Sheet #1

(Logic and Proofs)

1. Construct a truth table for each of the following compound propositions, where p, q, r denote primitive
propositions. Which of these propositions are tautologies?
( ) ( )
b)
( )
a)
( )
c)
( )
[ ( )]
d)
e)
f)
( )

2. Determine all the truth value assignments, if any, for the primitive propositions p, q, r, s, t that make each of
the following compound propositions false.
a) [( ) ] ( )
b) [ ( )] ( )
3. Let p and q be the propositions
p: You drive over 65 miles per hour.
q: You get a speeding ticket.
Write the following propositions using p and q and logical connectives.
a) You don't drive over 65 miles per hour.
b) Your drive over 65 miles per hour, but you don't get a speeding ticket.
c) You will get a speeding ticket if you drive over 65 miles per hour.
d) If you don't drive over 65 miles per hour, then you will not get a speeding ticket.
e) Driving over 65 miles per hour is sufficient for getting a speeding ticket.
f) You get a speeding ticket, but you don't drive over 65 miles per hour.
g) Whenever you get a speeding ticket, you are driving over 65 miles per hour.

4. Verify that [ ( )] [( ) ( )] is tautology.

5. Negate each of the following, and simplify the resulting proposition

( ) ( )
a)
( ) ( ) b)
d)
( )
e)
( )

c)

( )

6. Using truth tables, establish the following logical equivalence

( ) ( )

7. Provide the steps and reasons to establish the following logical equivalences
a) [ ( )]

b) ( )

c) [( ) ( )

d) ( ) ( ) ( )

8. Negate and simplify each of the following

a)
[() ()]
c)
[() ()]

b)
d)

[() ()]
() () ()

9. Let p(x) be the statement "x can speak Russian" and let q(x) be the statement "x knows the computer
language C++." Express each of the following sentences in the terms of p(x), q(x), quantifiers, and logical
connectives. For the universe of discourse for quantifiers use the set of all students at your faculty.
a) There is a student at your faculty who can speak Russian and who knows C++
b) There is a student at your faculty who can speak Russian but who doesn't know C++
c) Every student at your faculty either can speak Russian or knows C++
d) No student at your faculty can speak Russian or knows C++

10. For the following statements, the universe comprises all non-zero integers. Determine the truth value of
each statement
a)
[ = 1]
b)
[ = 1]
c)
[ = 1]
d)
[(2 + = 5) ( 3 = 8)]
e)
[(3 = 7) (2 + 4 = 3)]
11. Repeat problem 10 with a universe of all non-zero real numbers.

12. Use quantifiers to express the following statements

a) Every computer science student needs a course in discrete mathematics
b) There is a student in this class who owns a personal computer
c) Every student in this class has taken at least one computer science course
d) There is a student in this class who has taken at least one course in computer science
e) Every student in this class has been in every building on campus
13. Let M(x, y) be "x has sent y an e-mail message" and T(x, y) be "x has telephoned y", where the domains
consist of all students in your class. Use quantifiers to express each of the following statements. (Assume
that all e-mail messages that were sent are received)
a) Every student in your class has sent an e-mail message to Ahmed
b) Everyone in your class has either telephoned Aly or sent him an e-mail message
c) There is a student in your class who has sent everyone else in your class an e-mail message
d) There are two different students in your class who have sent each other e-mail messages
e) There is a student in your class who has not received an e-mail message from anyone else in the
class and who has not been called by any other student in the class
f) Every student in the class has either received an e-mail message or received a telephone call from
another student in the class
14. Establish the validity of the following arguments
a) [ ( ) ( ) ( )] ( )
b) ( )
( )


----------------------
[(
c)
) ( ) ( )] ( )

15. Verify the following arguments

() () ()
[() ()]
--------------------------------------------- [() ()]

16. Show that each of the following arguments is invalid

a) ( ) [ ( )]
b) [( ) ] ( )

17. Write each of the following arguments in symbolic form. Then establish the validity of the argument or give a
counterexample to show that it is invalid.
a) If Dominic goes to the racetrack, then Helen will be mad. If Ralph plays cards all night, then Carmella
will be mad. If either Helen or Carmella gets mad, then Veronica (their attorney) will be notified.
Veronica has not heard from either of these two clients. Consequently, Dominic didn't make it to the
racetrack and Ralph didn't play cards all night.
b) If there is a chance of rain or her read headband is missing, then Lois will not mow her lawn.
Whenever the temperature is over 80oF, there is no chance for rain. Today the temperature is 85oF
and Lois is wearing her red headband. Therefore (sometime today) Lois will mow her lawn.
**********************************

Rules of Logic
For primitive propositions p, q, r, any tautology To and any contradiction Fo
1)
2)
3)
4)
5)
6)
7)
8)
9)
10)
11)
12)

( )

Law of Double Negation

DeMorgan's Laws

( )

Commutative Laws

Associative Laws

( ) ( )
( ) ( )

( ) ( ) ( )

Distributive Laws

( ) ( ) ( )

Idempotent Laws

Identity Laws

Negation Laws

Domination Laws

Absorption Laws

( )

Definition of Implication

( )

( ) ( )

Definition of Bi-conditional

Rules of Inference
1)

2)

3)

4)

5)

6)
7)
8)

9)

10)

11)

*Not in Textbook

__________

__________

__________

__________

__________

__________

__________

__________

__________

__________

__________

Rule of Detachment (Modus Ponens)

Rule of Hypothetical Syllogism

Modus Tollens

Rule of Conjunction

Rule of Disjunctive Syllogism

Rule of Simplification
Rule of Addition
Rule of Resolution

Rule for Proof by Cases*

Rule of the Constructive Dilemma*

Rule of the Destructive Dilemma*