Theory assignment #1 Answer Key

===============================

1. Each part worth 3 points

i.
t: "computers can think"
e: "computers can have emotions"
d: "computers can have desires"

Argument:
t <-> e
e -> d
d -> ~t
therefore ~t

a. Since every line in which the premises are all true also has a true conclusion, the
argument is valid (bold and italicized below).

t e d t <-> e e -> d d -> ~t ~t

T T T T T F F
T T F T F T F
T F T F T F F
T F F F T T F
F T T F T T T
F T F F F T T
F F T T T T T
F F F T T T T

b. deduction:

Proof:

1. t <-> e
2. e -> d
3. d -> ~t
4. t -> e ^ e -> t ! ! 1, biconditional
5. t -> e! ! ! 4, specialization
6. t-> d! ! ! 5,2, transitivity
7. t -> ~t! ! ! 6,3 transitivity
8 ~t v ~t! ! ! 7, implication
9. ~t! ! ! ! 8, idempotent

1.b.

b: "The butler murdered Jacques."

m: "The maid is lying"
g: "The gardener murdered Jacques."
s: "The weapon was a spoon."

(b -> m) ^ (g->s) ^ (~s->b)

therefore b

a. This argument is invalid-- there are several lines where the premise is true, but the
conclusion is false (bold and italicized below). Note that you could have done this with
just the top line, but I chose to break up the premise to make it easier for you to see.

b m g s (b -> m) ^ (g->s) ^ (~s->b) b

b -> m g->s ~s->b
T T T T T T T T
T T T F T F T T
T T F T T T T T
T T F F T T F T
T F T T F T T T
T F T F F F T T
T F F T F T T T
T F F F F T F T
F T T T T T T F
F T T F T F T F
F T F T T T T F
F T F F T T F F
F F T T T T T F
F F T F T F T F
F F F T T T T F
F F F F T T F F

b. No proof exists, the argument is invalid

2. Each part worth 3 points

a. consistent (for a,b,c, resp: TTT, FTT, FFT, FFF all work)
b. consistent (TTT)
c. consistent (TFT, TFF, FFT, FFF)
d. inconsistent

3. Each part worth 3 points

a.
b. Proof can be a simplification or truth table:

Original:

([P OR ~(~P AND Q)] OR ~ [(R AND ~S) OR S] ) AND [(R AND ~S) OR S]
([(P OR ~P) AND (P OR Q)] OR ~ [(R AND ~S) OR S] ) AND [(R AND ~S) OR S] distribution
([T AND (P OR Q)] OR ~ [(R AND ~S) OR S] ) AND [(R AND ~S) OR S] negation
([P OR Q] OR ~ [(R AND ~S) OR S] ) AND [(R AND ~S) OR S] identity
([P OR Q] OR ~ [(R OR S) AND (~S OR S)] ) AND [(R OR S) AND (~S OR S)] distribution
([P OR Q] OR ~ [(R OR S) AND T] ) AND [(R OR S) AND T] negation
([P OR Q] OR ~ [R OR S] ) AND [R OR S] identity
([(P OR Q) OR (R AND S)] AND [~(R OR S) OR (R OR S)]) distribution
([(P OR Q) OR (R AND S)] AND T) negation
([(P OR Q) OR (R AND S)]) identity

4. Each part worth 3 points

a. (a v c) ^ ~d

b. a

c!

5. 3 points

a. 1 half, 31 full… because everything besides the first two digits may need a carry (or
something else reasonable)

6a. Each part worth 3 marks (note that iv only has one part)
i.
a. 10001
b. 11
c. 21

ii.
a. 100100001
b. 121
c. 441

iii.
a. 1000110101001
b. 11A9
c. 10651

6b.
i.
a. 170
b. -86

ii.
a. 255
b. -1

iii.
a. 127
b. 127

6c.
i.
101000100
000001100
---------
101010000

ii.
10000011010 (41A)
00000100010 (22)
-----------
01111111000 (3F8)

iii.
010001 (17)
100010 (-30, 2's comp)
------ ADD
110011 (-13, 2's comp)