Discrete Structures

Lesson #2: Logic

Assignment

1. Evaluate each proposition for the truth values given that: p = F q=T r=F
a. p  q : ___________
b. (p  q)  (p  r) : ___________
c. p  q : ___________

2. Write the truth table of the proposition (p  q)  p

p q (p  q)  p

3. Represent the statement symbolically by letting

p : There is a hurricane q: It is raining
a. There is no hurricane : _____________________________
b. Either there is a hurricane or it is raining (or both) : _____________________________
c. Either there is a hurricane or it is raining, but there is no hurricane : _____________________________

4. Given the statement: “The program is readable only if it is well structured”.

a. Write the if – then form of the statement:
_________________________________________________________________
b. Write the converse of the statement:
_________________________________________________________________
c. Write the inverse of the statement :
_________________________________________________________________
5. Let P(x) be the function “x divides 77”, the domain of discourse is the set of positive integers. Tell whether each
proposition is TRUE or FALSE
a. P(11) :_________
b. P(1) :_________
c. P(3) :_________
d. For every x, P(x) :_________
e. For some x, P(x) :_________