Phi 270 F06 test 5

Analyze the following sentences in as much detail as possible, providing a key to the items of non-logical vocabulary (upper and lower case letters apart from variables) that appear in your answer. Notice the special instructions given for each of 1, 2, and 3.

1.

Someone called Tom. [Give an analysis using a restricted quantifier, and restate it using an unrestricted quantifier.]

answer
2.

Not a crumb was left, but there was a note from Santa. [Do not use ∀ in your analysis of this; that is, use ∃ in your analysis of any quantifier phrases.]

answer
3.

A card was sent to each customer. [On one way of understanding this sentence, it would be true even if no two customers were sent the same card. Analyze it according to that interpretation.]

answer
4.

At most one size was left.

answer

Analyze the sentence below using each of the two ways of analyzing the definite description. That is, give an analysis that uses Russell’s treatment of definite descriptions as quantifier phrases as well as one that uses the description operator.

5.

Ann found the note that Bill left.

answer

Use a derivation to show that the following argument is valid. You may use any rules.

6.
∃x (Fx ∧ Gx)
∀x (Gx → Hx)
∃x Hx
answer

Use a derivation to show that the following argument is not valid, and use either a diagram or tables to present a counterexample that divides an open gap of your derivation.

7.
∃x ∃y (Rxa ∧ Ray)
∃x Rxx
answer
Complete the following to give a definition of equivalence in terms of truth values and possible worlds:
8.

A pair of sentences φ and ψ are logically equivalent (in symbols, φ ≃ ψ) if and only if ...

answer
Analyze the sentence below using abstracts and variables to represent pronominal cross reference to individual terms (instead of replacing pronouns by such antecedents). An individual term should appear in your analysis only as often as it appears in the original sentence.
9.

Ann wrote to Bill and he called her.

answer

Phi 270 F06 test 5 answers

1.

Someone called Tom

Someone is such that (he or she called Tom)

(∃x: x is a person) x called Tom

(∃x: Px) Cxt
∃x (Px ∧ Cxt)
C: [ _ called _]; P: [ _ is a person]; t: Tom
2.

Not a crumb was left, but there was a note from Santa

Not a crumb was leftthere was a note from Santa

¬ a crumb was leftsomething was a note from Santa

¬ some crumb is such that (it was left)something is such that (it was a note from Santa)

¬ (∃x: x is a crumb) x was left ∧ ∃y (y was a note from Santa)

¬ (∃x: Cx) Lx ∧ ∃y (y was a note ∧ y was from Santa)

¬ (∃x: Cx) Lx ∧ ∃y (Ny ∧ Fys)
C: [_ is a crumb]; F: [ _ was from _]; L: [ _ was left]; N: [ _ was a note]; s: Santa
3.

A card was sent to each customer

each customer is such that (a card was sent to him or her)

(∀x: x is a customer) a card was sent to x

(∀x: Cx) some card is such that (it was sent to x)

(∀x: Cx) (∃y: y is a card) y was sent to x

(∀x: Cx) (∃y: Dy) Syx
C: [ _ is a customer]; D: [ _ is a card]; S: [ _ was sent to _ ]

Some card is such that (it was sent to each customer) would be true only if there was at least one card that was sent to all customers, so an analysis of it would not be a correct answer

4.

At most one size was left

¬ at least two sizes were left

¬ at least two sizes are such that (they were left)

¬ (∃x: x is a size) (∃y: y is a size ∧ ¬ y = x) (x was left ∧ y was left)

¬ (∃x: Sx) (∃y: Sy ∧ ¬ y = x) (Lx ∧ Ly)
S: [ _ is a size]; L: [ _ was left]

also correct: (∀x: Sx) (∀y: Sy ∧ ¬ y = x) ¬ (Lx ∧ Ly)
also correct: (∀x: Sx ∧ Lx) (∀y: Sy ∧ Ly) x = y

5.

Using Russell’s analysis:

Ann found the note that Bill left

the note that Bill left is such that (Ann found it)

(∃x: x is a note that Bill leftonly x is a note that Bill left) Ann found x

(∃x: (x is a noteBill left x) ∧ (∀y: ¬ y = x) ¬ (y is a noteBill left x)) Fax

(∃x: (Nx ∧ Lbx) ∧ (∀y: ¬ y = x) ¬ (Ny ∧ Lby)) Fax

also correct: (∃x: (Nx ∧ Lbx) ∧ ¬ (∃y: ¬ y = x) (Ny ∧ Lby)) Fax
also correct: (∃x: (Nx ∧ Lbx) ∧ (∀y: Ny ∧ Lby) x = y) Fax

 

Using the description operator:

Ann found the note that Bill left

[ _ found _ ] Ann (the note that Bill left)

Fa(Ix x is note that Bill left)

Fa(Ix (x is a noteBill left x))

Fa(Ix (Nx ∧ Lbx))
F: [ _ found _ ]; L: [ _ left _ ]; N: [ _ is a note]; a: Ann; b: Bill
6.
│∃x (Fx ∧ Gx) 1
│∀x (Gx → Hx) a: 3
├─
│ⓐ
││Fa ∧ Ga 2
│├─
2 Ext ││Fa
2 Ext ││Ga (4)
3 UI ││Ga → Ha 4
4 MPP ││Ha (5)
5 EG ││∃x Hx X,6
││●
│├─
6 QED ││∃x Hx 1
├─
1 Pch │∃x Hx

Many different orders are possible for the rules used. In particular, NcP could be used before PCh in the second.

or
│∃x (Fx ∧ Gx) 1
│∀x (Gx → Hx) a: 3
├─
│ⓐ
││Fa ∧ Ga 2
│├─
2 Ext ││Fa
2 Ext ││Ga (4)
3 UI ││Ga → Ha 4
4 MPP ││Ha (7)
││
│││∀x ¬ Hx a: 6
││├─
6 UI │││¬ Ha (7)
│││●
││├─
7 Nc │││⊥ 5
│├─
5 NcP ││∃x Hx 1
├─
1 PCh │∃x Hx
7.
│∃x ∃y (Rxa ∧ Ray) 1
├─
│ⓑ
││∃y (Rba ∧ Ray) 2
│├─
││ⓒ
│││Rba ∧ Rac 3
││├─
3 Ext │││Rba
3 Ext │││Rac
│││
││││∀x ¬ Rxx a:5, b:6, c:7
│││├─
5 UI ││││¬ Raa
6 UI ││││¬ Rbb
7 UI ││││¬ Rcc
││││○ Rba, Rac, ¬ Raa, ¬ Rbb, ¬ Rcc ⊭ ⊥
│││├─
││││⊥ 4
││├─
4 NcP │││∃x Rxx 2
│├─
2 PCh ││∃x Rxx 1
├─
1 PCh │∃x Rxx
range: 1, 2, 3
abc
123
  R    1  2  3 
1 F F T
2 T F F
3 F F F
8.

A pair of sentences φ and ψ are logically equivalent if and only if there is no possible world in which φ and ψ have different truth values

or

A pair of sentences φ and ψ are logically equivalent if and only if φ and ψ have the same truth value as each other in every possible world

9.

Ann wrote to Bill and he called her

Ann and Bill are such that (she wrote to him and he called her)

[x wrote to y and y called x]xy Ann Bill

[x wrote to y ∧ y called x]xyab

[Wxy ∧ Cyx]xyab
C: [ _ called _ ]; W: [ _ wrote to _ ]; a: Ann; b: Bill