phi_270_F96_test

Phi 270 F96 test 3

F96 test 3 questions

(Questions 1-6 are from quiz 3 and 7-9 are from quiz 4 out of 6 quizzes—these two quizzes addressed the part of the course your test is designed to cover.)

Analyze the sentences below in as much detail as possible without going below the level of sentences (i.e., without recognizing individual terms and predicates). Be sure that the unanalyzed components of your answer are complete and independent sentences and that you respect any grouping in the English.
	1.	`You won’t succeed unless you try.` answer
	2.	`If it was after 5, Sam got in only if he had a key.` answer

Check each of the following claims of entailment using the basic system of derivations (i.e., do not use attachment rules but you may use detachment rules). If a derivation fails, present a counterexample that divides its premises from its conclusion.
	3.	(A ∧ B) → C ⊨ A → C answer
	4.	C → (A → B) ⊨ (A ∧ ¬ B) → ¬ C answer

5.	Analyze the sentence below in as much detail as possible, continuing the analysis when there are no more connectives by identifying predicates, functors, and individual terms. Be sure that the unanalyzed expressions in your answer are independent and that you respect any grouping in the English.
	`If Ann’s car is the one you saw, she wasn’t driving it.` answer

6.	a.	Give two different expansions (using predicate abstracts) of the reduced form: Raa. answer
	b.	Put the following into reduced form: [Fx ∧ Pxb]_xc. answer

7.	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 either using tables or, where possible, using diagrams.)
	a = c, ga = gb, Pa, ¬ P(ga), Rab, Rbc, ¬ Rc(ga) answer

Check each of the claims of entailment below using derivations. You need not describe structures dividing gaps you leave open.
	8.	Ha ∧ c = d, G(fd) ⊨ G(fc) ∧ (a = b → Hb) answer
	9.	Ra(fa) ∧ Rb(fb), fa = b ⊨ Ra(f(fa)) answer

F96 test 3 answers

1.	`You won’t succeed unless you try` `you won’t succeed` ← ¬ `you will try` ¬ `you will succeed` ← ¬ `you will try` ¬ S ← ¬ T or ¬ T → ¬ S `if not` T `then not` S S: `you will succeed`; T: `you will try`

2.	`If it was after 5, Sam got in only if he had a key` `it was after 5` → `Sam got in only if he had a key` `it was after 5` → (¬ `Sam got in` ← ¬ `Sam had a key`) A → (¬ G ← ¬ K) or A → (¬ K → ¬ G) `if` A `then if not` K `then not` G A: `it was after 5`; G: `Sam got in`; K: `Sam had a key`

	│(A ∧ B) → C	3
	├─
	││A	(4)
	│├─
	│││¬ C	(3)
	││├─
3 MTT	│││¬ (A ∧ B)	4
4 MPT	│││¬ B
	│││○	A,¬ B,¬ C ⊭ ⊥
	││├─
	│││⊥	2
	│├─
2 IP	││C	1
	├─
1 CP	│A → C

A	B	C	(A	∧	B)	→	C	/	A	→	C
T	F	F		F		Ⓣ				Ⓕ

	│C → (A → B)	4
	├─
	││A ∧ ¬ B	2
	│├─
2 Ext	││A	(5)
2 Ext	││¬ B	(6)
	││
	│││C	(4)
	││├─
4 MPP	│││A → B	5
5 MPP	│││B	(6)
	│││●
	││├─
6 Nc	│││⊥	3
	│├─
3 RAA	││¬ C	1
	├─
1 CP	│(A ∧ ¬ B) → ¬ C

If Ann’s car is the one you saw, she wasn’t driving it

Ann’s car is the one you saw → ¬ Ann was driving Ann’s car

Ann’s car = the car you saw → ¬ [ _ was driving _ ] Ann (Ann’s car)

[ _’s car] Ann = [the car _ saw] you → ¬ Da([ _’s car] Ann)

ca = ro → ¬ Da(ca)

D: [ _ was driving _ ]; a: Ann; c: [ _’s car]; o: you; r: [the car _ saw]

[ca = ro → ¬ Da(ro) is also a possible interpretation of the pronoun’s reference; the analysis is equivalent to the analysis one but would probably have different implicatures]

6.	a.	The following are the possibilities; in the last, τ may be any term: [Rxx]_xa, [Rxa]_xa, [Rax]_xa, [Raa]_xτ
	b.	Fc ∧ Pcb

range: 1, 2, 3

a	b	c
1	2	1

τ	gτ
1	3
2	3
3	1

τ	Pτ
1	T
2	F
3	F

R	1	2	3
1	F	T	F
2	T	F	F
3	F	F	F

(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.)

alias sets	IDs	values
a c	1	a: 1 c: 1
b	2	b: 2
ga gb	3	g1: 3 g2: 3

resources	values
Pa ¬ P(ga) Rab Rbc ¬ Rc(ga)	P1: T P3: F R12: T R21: T R13: F

	│Ha ∧ c = d
	│G(fd)	(3)
	├─
1 Ext	│Ha	(5)
1 Ext	│c = d	a,b,c-d,fc-fd
	│
	││●
	│├─
3 QED=	││G(fc)	2
	│
	│││a = b	a-b,c-d,fc-fd
	││├─
	│││●
	││├─
5 QED=	│││Hb	4
	│├─
4 CP	││a = b → Hb	2
	├─
2 Cnj	│G(fc) ∧ (a = b → Hb)

	│Ra(fa) ∧ Rb(fb)	1
	│fa = b	a,b-fa,fb-f(fa)
	├─
1 Ext	│Ra(fa)
1 Ext	│Rb(fb)
	│
	││¬ Ra(f(fa))
	│├─
	││○	fa=b,Ra(fa),Rb(fb),¬Ra(f(fa)) ⊭ ⊥
	│├─
	││⊥	2
	├─
2 IP	│Ra(f(fa))