The logical form produced by this second analysis is not equivalent to the one produced by the first analysis. It could be said that the first interprets else as referring to Adam and the other officer collectively while the second interprets it as referring to them individually. The latter interpretation produces a pair of generalizations each of whose domains excludes only one of Adam and the other officer rather than both together. That means that, on the second analysis, the sentence Adam and another officer thanked everyone else together with the assumption that Adam and the other officer are both people entails that they thanked each other. The second interpretation could be made more likely by stating the sentence in the form Adam and another officer each thanked everyone else.
f. |
At least two things went wrong ∃x (∃y: ¬ y = x) (x and y went wrong) ∃x (∃y: ¬ y = x) (x went wrong ∧ y went wrong)
∃x (∃y: ¬ y = x) (Wx ∧ Wy)
W: [ _ went wrong] |
g. |
Bill spoke to at most one person ¬ Bill spoke to at least two people ¬ at least two people are such that (Bill spoke to them) ¬ (∃x: x is a person) (∃y: y is a person ∧ ¬ y = x) (Bill spoke to x and y) ¬ (∃x: Px) (∃y: Py ∧ ¬ y = x) (Bill spoke to x ∧ Bill spoke to y)
¬ (∃x: Px) (∃y: Py ∧ ¬ y = x) (Sbx ∧ Sby)
S: [ _ spoke to _ ]; b: Bill |
h. |
At least one thing will do ∧ at most one thing will do ∃x x will do ∧ ¬ at least 2 things will do ∃x Dx ∧ ¬ ∃x (∃y: ¬ y = x) (x and y will do) ∃x Dx ∧ ¬ ∃x (∃y: ¬ y = x) (x will do ∧ y will do)
∃x Dx ∧ ¬ ∃x (∃y: ¬ y = x) (Dx ∧ Dy)
D: [ _ will do] or: ∃x (x will do ∧ nothing other than x will do) ∃x (Dx ∧ (∀y: ¬ y = x) ¬ y will do)
∃x (Dx ∧ (∀y: ¬ y = x) ¬ Dy)
or: ∃x (x will do ∧ x is all that will do) ∃x (Dx ∧ everything that will do is such that (x is it)) ∃x (Dx ∧ (∀y: y will do) x is y)
∃x (Dx ∧ (∀y: Dy) x = y)
|
i. |
Ann saw more than one assassin Ann saw at least two assassins At least two assassins are such that (Ann saw them) (∃x: x is an assassin) (∃y: y is an assassin ∧ ¬ y = x) (Ann saw x and y) (∃x: Ax) (∃y: Ay ∧ ¬ y = x) (Ann saw x ∧ Ann saw y)
(∃x: Ax) (∃y: Ay ∧ ¬ y = x) (Sax ∧ Say)
A: [ _ is an assassin]; S: [ _ saw _ ]; a: Ann |
j. |
Ann saw exactly two assassins Exactly two assassins are such that (Ann saw them) Two assassins are such that (Ann saw them and no other assassins) (∃x: x is an assassin) (∃y: y is an assassin ∧ ¬ y = x) (Ann saw x and y and no other assassins) (∃x: Ax) (∃y: Ay ∧ ¬ y = x) (Ann saw x ∧ Ann saw y ∧ Ann saw no assassin other than x and y) (∃x: Ax) (∃y: Ay ∧ ¬ y = x) ((Sax ∧ Say) ∧ no assassin other than x and y is such that (Ann saw him or her)) (∃x: Ax) (∃y: Ay ∧ ¬ y = x) ((Sax ∧ Say) ∧ (∀z: z is an assassin ∧ (¬ z = x ∧ ¬ z = y)) ¬ Ann saw z)
(∃x: Ax) (∃y: Ay ∧ ¬ y = x) ((Sax ∧ Say) A: [ _ is an assassin]; S: [ _ saw _ ]; a: Ann or:
(∃x: Ax) (∃y: Ay ∧ ¬ y = x) ((Sax ∧ Say) The formula (∀z: Az ∧ Saz) (x = z ∨ y = z)) that is used here amounts to x and y are all the assassins Ann saw, for it says of any assassin that Ann saw that either x or y is that individual. |
2. | a. |
Tom found Tom’s hat ∧ (∃x: ¬ x = Tom’s hat) Tom lost x Tom found his hat ∧ (∃x: x is other than Tom’s hat) Tom lost x Tom found his hat ∧ something other than Tom’s hat is such that (Tom lost it) Tom found his hat ∧ Tom lost something other than his hat Tom found his hat but he lost something else |
b. |
(∃x: x is a person) (∃y: y is a person ∧ ¬ y = x) x spoke to y (∃x: x is a person) (∃y: y is a person ∧ y is other than x) x spoke to y (∃x: x is a person) (∃y: y is a person other than x) x spoke to y (∃x: x is a person) someone other than x is such that (x spoke to him or her) (∃x: x is a person) x spoke to someone else Someone is such that (he or she spoke to someone else) Someone spoke to someone else |
c. |
(∀x: x is a person ∧ ¬ x = Mary) ¬ Sam recognized x (∀x: x is a person ∧ x is other than Mary) ¬ Sam recognized x (∀x: x is a person other than Mary) ¬ Sam recognized x No one other than Mary is such that (Sam recognized him or her)
Sam recognized no one other than Mary
|
d. |
(∃x: x is a store) x was open ∧ ¬ (∃x: x is a store) (∃y: y is a store ∧ ¬ y = x) (x was open ∧ y was open) At least one store was open ∧ ¬ (∃x: x is a store) (∃y: y is a store ∧ ¬ y = x) (x and y were open) At least one store was open ∧ ¬ at least two stores are such that (they were open) At least one store was open ∧ ¬ at least 2 stores were open At least one store was open ∧ at most 1 store was open Just one store was open |