CMSC 250 Homework 1 ANSWERS Fall 2004
Solutions
You must write the solutions to the problems single-sided on your own lined paper, with all sheets stapled together, and with all answers written in sequential order or you will lose points.
- Convert the following sentences to logical expressions assuming that ``j'', ``k'' and ``l'' represent the propositions below.
- j = ``Jane likes to swim.''
- k = ``Kyle likes to swim.''
- l = ``Lauren likes to swim.''
- Nobody likes to swim.
or
- Nobody except Lauren likes to swim.
- Somebody in addition to Lauren likes to swim.
- Determine which of the following are statements and which are not.
- How high is that?
This is not a statement.
- ``What'' is a word that is used to start a question.
This is a statement.
- This sentence refers to itself.
This is a statement (it is true).
- This sentence does not refer to itself.
This is a statement (it is false).
- For each of the following, translate the logical expression to an
English statement and then give the set of values that make the statement
true. Assume that we restrict ourselves only to the set of integers
, and that we are using the
following propositions:
- a = ``n is even.''
- b = ``n is at most 7.''
- c = ``n is an exact multiple of 3.''
-
n is even and not a exact multiple of 3
-
.
n is an exact multiple of 3 and it is either odd or greater than 7
n is greater than 7 or it is a multiple of 3
- Let
,
, and
be statements. Construct the complete truth table for the following statement:
.
 |
 |
 |
 |
 |
 |
 |
| 1 |
1 |
1 |
1 |
0 |
1 |
1 |
| 1 |
1 |
0 |
1 |
1 |
1 |
1 |
| 1 |
0 |
1 |
1 |
0 |
1 |
1 |
| 1 |
0 |
0 |
1 |
1 |
1 |
1 |
| 0 |
1 |
1 |
1 |
0 |
0 |
0 |
| 0 |
1 |
0 |
1 |
1 |
1 |
1 |
| 0 |
0 |
1 |
0 |
0 |
0 |
0 |
| 0 |
0 |
0 |
0 |
1 |
1 |
0 |
- Let
,
, and
be statements. Construct the complete truth table for the following statement:
.
 |
 |
 |
 |
 |
 |
| 1 |
1 |
1 |
0 |
1 |
1 |
| 1 |
1 |
0 |
1 |
1 |
1 |
| 1 |
0 |
1 |
0 |
0 |
0 |
| 1 |
0 |
0 |
1 |
1 |
1 |
| 0 |
1 |
1 |
0 |
1 |
0 |
| 0 |
1 |
0 |
1 |
1 |
0 |
| 0 |
0 |
1 |
0 |
0 |
0 |
| 0 |
0 |
0 |
1 |
1 |
0 |
- Let
and
be statements. Construct the complete truth table for the following statement:
 |
 |
 |
 |
 |
 |
 |
| 1 |
1 |
0 |
0 |
1 |
1 |
1 |
| 1 |
0 |
0 |
1 |
0 |
0 |
1 |
| 0 |
1 |
1 |
0 |
1 |
0 |
0 |
| 0 |
0 |
1 |
1 |
1 |
0 |
1 |
Kin-Keung Ma
2004-09-08
Web Accessibility