Phi 270 F04 test 4

F04 test 4 topics

The following are the topics to be covered. The proportion of the test covering each will approximate the proportion of the classes so far that have been devoted to that topic. Your homework and the collection of old tests will provide specific examples of the kinds of questions I might ask.

Analysis. Be ready to handle any of the key issues discussed in class--for example, the proper analysis of every, no, and only (§7.2), how to incorporate bounds and exceptions (§7.2), ways of handling compound quantifier phrases (such as only cats and dogs, §7.3), the distinction between every and any (§§7.3 and 7.4), how to represent multiple quantifier phrases with overlapping scope (§7.4). Be able restate you analysis using unrestricted quantifiers, but you will not need to present it in English notation.

Synthesis. You may be given a symbolic form and an interpretation of its non-logical vocabulary and asked to express the sentence in English. (This sort of question is less likely to appear than a question about analysis and there would certainly be substantially fewer such questions.)

Derivations. Be able to construct derivations to show that entailments hold and to show that they fail (derivations that hold are more likely). I may tell you in advance whether an entailment holds or leave it to you to check that using derivations. If a derivation fails, you may be asked to present a counterexample, which will involve describing a structure. In derivations involving restricted universals you will have the option using the rules RUG, SB, SC, and MRC or instead using RUP and RUC along with rules for unrestricted universals and conditionals. You will not be responsible for the rules introduced in §7.8.


F04 test 4 questions

Analyze the sentences below in as much detail as possible, providing a key to the non-logical vocabulary you use. Restate 2 using an unrestricted quantifier.
1. Sam checked every lock
answer
2. No one who was in the office answered the call
[Remember to restate your answer in 2 using an unrestricted quantifier.]
answer
3. Ralph got the joke if anyone did
answer
4. Only bestsellers were on every list
answer
Use derivations to show that the following arguments are valid. You may use any rules.
5.
∀x Fx
∀x ¬ Gx
∀x (Fx ∧ ¬ Gx)
answer
6.
∀x (Rxa → ∀y Txy)
∀x ∀y (Rya → Tyx)
answer
Use a derivation to show that the following argument is not valid and present a counterexample by describing a structure that divides an open gap. (You may describe the structure either by depicting it in a diagram, as answers in the text usually do, or by giving tables.)
7.
∀x Rax
∀x (Rxa → Rxx)
answer

F04 test 4 answers

1.

Sam checked every lock

Every lock is such that (Sam checked it)

(∀x: x is a lock) Sam checked x

(∀x: Lx) Csx

C: [ _ checked _ ]; L: [ _ is a lock]; s: Sam

2.

No one who was in the office answered the call

No one who was in the office is such that (he or she answered the call)

(∀x: x is a person who was in the office) ¬ x answered the call

(∀x: x is a person ∧ x was in the office) ¬ Axc

(∀x: Px ∧ Nxo) ¬ Axc
∀x ((Px ∧ Nxo) → ¬ Axc)

A: [ _ answered _ ]; P: [ _ is a person]; N: [ _ was in _ ]; c: the call; o: the office

3.

Ralph got the joke if anyone did

Everyone is such that (Ralph got the joke if he or she did)

(∀x: x is a person) Ralph got the joke if x did

(∀x: Px) (Ralph got the joke ← x got the joke)

(∀x: Px) (Grj ← Gxj)
(∀x: Px) (Gxj → Grj)

P: [ _ is a person]; G: [ _ got _ ]; j: the joke

4.

Only bestsellers were on every list

Only bestsellers are such that (they were on every list)

(∀x: ¬ x is a bestseller) ¬ x was on every list

(∀x: ¬ Bx) ¬ every list is such that (x was on it)

(∀x: ¬ Bx) ¬ (∀y: y is a list) x was on y

(∀x: ¬ Bx) ¬ (∀y: Ly) Nxy

B: [ _ is a bestseller]; L: [ _ is a list]; N: [ _ was on _ ]

5.
│∀x Fx a: 3
│∀x ¬ Gx a: 5
├─
│ⓐ
3 UI │││Fa (4)
│││●
││├─
4 QED │││Fa 2
││
5 UI │││¬ Ga (6)
│││●
││├─
6 QED │││¬ Ga 2
│├─
2 Cnj ││Fa ∧ ¬ Ga 1
├─
1 UG │∀x (Fx ∧ ¬ Gx)
6.
│∀x (Rxa → ∀y Txy) c:4
├─
│ⓑ
││ⓒ
││││Rca (5)
│││├─
4 UI ││││Rca → ∀y Tcy 5
5 MPP ││││∀y Tcy b: 6
6 UI ││││Tcb (7)
││││●
│││├─
7 QED ││││Tcb 3
││├─
3 CP │││Rca → Tcb 2
│├─
2 UG ││∀y (Rya → Tyb) 1
├─
1 UG │∀x ∀y (Rya → Tyx)
7.
│∀x Rax a:4, b:5
├─
│ⓑ
│││Rba
││├─
││││¬ Rbb
│││├─
4 UI ││││Raa
5 UI ││││Rab
││││○ Rba, ¬Rbb, Raa, Rab ⊭⊥
│││├─
││││⊥ 3
││├─
3 IP │││Rbb 2
│├─
2 CP ││Rba → Rbb 1
├─
1 UG │∀x (Rxa → Rxx)

Counterexample presented by a diagram

Counterexample presented by tables

range: 1, 2
ab
12
R12
1TT
2TF