phi_270_F96_test

Phi 270 F96 test 5

F96 test 5 questions

(These questions are from the last of the 6 quizzes given in F96.)

Analyze the following sentences in as much detail as possible, providing a key to the non-logical vocabulary (upper and lower case letters) appearing in your answer.
1.	`Ned has visited a museum in Linden`. [Give this analysis also using an unrestricted quantifier.] answer

2.	`Something blocked each route`. [This sentence is ambiguous. Analyze it in two ways, as making a claim of general exemplification and as making the stronger claim of uniformly general exemplification, and indicate which analysis is which.] answer

3.	`At most one plan was implemented`. answer

Analyze the sentence below using each of the two ways of analyzing definite descriptions. That is, analyze it using Russell’s analysis of definite descriptions as quantifier phrases and then analyze it again using the description operator.
4.	`The scout you saw saw you`. answer

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

∃x Rax
∀x (∃y Ryx → Fx)

∃x Fx

Use a derivation to show that the following argument is not valid and describe a structure dividing an open gap.

∃x Fx
Ga

∃x (Fx ∧ Gx)

Complete the following to give a definition of entailment in terms of truth values and possible worlds:
7.	A sentence φ is entailed by a set Γ if and only if … answer

Describe a structure (i.e., an assignment of extensions to the non-logical vocabulary) which makes the following sentences all true. (You may present the structure using either tables or a diagram.)
8.	a = b, fb = fc, Pa, ¬ P(fa), Rab, ¬ Rbc, Rb(fb) answer

Give two different restatements of the sentence below in expanded form as a complex predicate (i.e., an abstract) applied to a term.
9.	Fa ∧ Ga answer

F96 test 5 answers

1.	`Ned has visited a museum in Linden` (∃x: x `is a museum in Linden`) `Ned has visited` x (∃x: x `is a museum` ∧ x `is in Linden`) `Ned has visited` x (∃x: Mx ∧ Nxl) Vnx ∃x ((Mx ∧ Nxl) ∧ Vnx) M: [ _ `is a museum`]; N: [ _ `is in` _ ]; V: [ _ `has visited` _ ]; l: `Linden`; n: `Ned`

2.	general exemplication (∀x: x `is a route`) `something blocked` x (∀x: Rx) ∃y y `blocked` x (∀x: Rx) ∃y Byx uniformly general exemplication ∃y y `blocked each route` ∃y (∀x: x `is a route`) y `blocked` x ∃y (∀x: Rx) Byx B: [ _ `blocked` _ ]; R: [ _ `is a route`]

3.	`At most one plan was implemented` ¬ `at least two plans were implemented` ¬ (∃x: x is a plan) (∃y: y is a plan ∧ ¬ y = x) (x `was implemented` ∧ y `was implemented`) ¬ (∃x: Px) (∃y: Py ∧ ¬ y = x) (Ix ∧ Iy) I: [ _ `was implemented`]; P: [ _ `is a plan`]

using Russell’s analysis:

the scout you saw is such that (he or she saw you)

(∃x: x and only x is a scout you saw) Sxo

(∃x: x is a scout you saw ∧ (∀y: ¬y = x) ¬ y is a scout you saw) Sxo

(∃x: (Tx ∧ Sox) ∧ (∀y: ¬y = x) ¬ (Ty ∧ Soy)) Sxo

using the description operator:

the scout you saw saw you

S(the scout you saw)o

S(I x x is a scout you saw)o

S(I x (x is a scout ∧ you saw x))o

S(I x (Tx ∧ Sox))o

S: [ _ saw _ ]; T: [ _ is a scout]; o: you

7.	A sentence φ is entailed by a set Γ of sentences if and only if there is no possible world in which φ is false while each member of Γ is true.

range: 1, 2, 3

a	b	c
1	1	3

(The diagram provides a complete answer, and so do the tables to its left. The tables below show a way of arriving at these answers.)

9.	The following are 4 possibilities (up to choice of the variable) from which your two might be chosen; in the last, τ may be any term:
	[Fx ∧ Gx]_xa [Fx ∧ Ga]_xa [Fa ∧ Gx ]_xa [Fa ∧ Ga]_xτ