tododismath
vazquez1012
tododismath.docxModule 04 Written Assignment
|
p |
q |
r |
Truth Value |
|
T |
T |
T |
T |
|
T |
T |
F |
T |
|
T |
F |
T |
F |
|
T |
F |
F |
F |
|
F |
T |
T |
F |
|
F |
T |
F |
T |
|
F |
F |
T |
T |
|
F |
F |
F |
F |
|
|
2. Write DNF and CNF for the following formula:
Also diagram a combinatorial (logic) circuit corresponding to this formula.
|
|
3. Write DNF and CNF for the following formula:
Also diagram a combinatorial (logic) circuit corresponding to this formula.
|
|
4. Write DNF and CNF for the following formula:
|
|
5. Let U be the set of all math problems, that is, assume that all the below represent math problems. Define 4 predicates over U as follows:
is solvable
is easy
is hard
|
Given the above, translate the following formulas into English: |
|
|
Problems |
Answers |
|
(a) |
|
|
(b) |
|
|
(c) |
|
|
Given the above, translate the following English statements into quantified formulas: |
|
|
(d) Some hard problems are not solvable. |
|
|
(e) For all problems, if it is easy then it is solvable. |
|
6. Find formulas in negation normal form equivalent to the following quantified formulas:
(a)
|
|
(b)
|
|
