You should now Launch Deriver and do the 4 exercises of Predicate Exercise 12 (Predex12).
Thus far the program has presented its conventions for
a = ARTHUR
b = BERYL
c = CHARLES
x = X
y = Y
z = Z
Sx = STUDIES
Tx = THINKS
Ax = ANGRY
Bx = BOLD
Cx = CHEERFUL
Nx = NINCOMPOOP
Px = PHILOSOPHER
but it also has conventions for transitive verbs, passive verbs, and binary adjectives. These are as follows
Axy = ANNOYS
Bxy = BRINGS
Dxy = DRIVEN BY
Exy = ENCOURAGED BY
Rxy = RUDER THAN
Sxy = SMARTER THAN
(you can also teach it transitive verbs, passive verbs,and binary adjectives by selecting one of
remember tverb (<english in here>) <capital in here>
remember pverb (<english in here>) <capital in here>
remember binadj (<english in here>) <capital in here>
and clicking Do Command; you will not need to teach the program
anything for these exercises.)
Form a view as to how the program will symbolize the following propositions, then ask it to do so by selecting the proposition and clicking To symbols. When you have symbolized the propositions, ask the program to translate them back by selecting each symbol and clicking To English.
a) Arthur annoys Beryl.
b) Beryl annoys Arthur.
c) Arthur is encouraged by Beryl.
d) Arthur is not smarter than Beryl.
e) Arthur annoys himself.
f) If Charles brings Arthur then Charles annoys Beryl.
Form a view as to how the program will symbolize the following propositions, then ask it to do so by selecting the proposition and clicking To symbols. When you have symbolized the propositions, ask the program to translate them back by selecting each symbol and clicking To English.
a) Everything that Arthur is smarter than thinks.
b) Something that Arthur is ruder than is a cheerful nincompoop.
c) Nothing that Charles annoys thinks.
d) Arthur is smarter than everything that Beryl is smarter than.
e) Charles is encouraged by something that Beryl is encouraged by.
f) Arthur is smarter than nothing that Beryl is encouraged by.
g) Arthur is ruder than everything that studies.
h) Arthur annoys something that studies.
Form a view as to how the program will symbolize the following propositions, then ask it to do so by selecting the proposition and clicking To symbols. When you have symbolized the propositions, ask the program to translate them back by selecting each symbol and clicking To English.
a) Everything is smarter than everything.
b) Everything is smarter than something.
c) Something is smarter than everything.
d) Everything is smarter than nothing.
e) Nothing is smarter than everything.
f) Something is smarter than something.
g) Something is smarter than nothing.
h) Nothing is smarter than something.
i) Nothing is smarter than nothing.
Form a view as to how the program will symbolize the following propositions, then ask it to do so by selecting the proposition and clicking To symbols. When you have symbolized the propositions, ask the program to translate them back by selecting each symbol and clicking To English.
a) Something is not a philosopher.
b) Some cheerful philosopher is not a nincompoop.
c) Something is smarter than everything.
d) Everything is smarter than something that studies.