## Ernest Lepore (RuCCS)

The truth tree system in Twootie matches closely with Meaning and Argument, but not exactly. The notes below should make switching between the two easier.

Corresponding Logics

 Meaning and Argument Twootie Propositional Logic (PL) Sentential Problems Property Predicate Logic (PPL) No real equivalent* Relational Predicate Logic (RPL) Predicate Logic Problems Relational Predicate Logic with Identity (RPL=) Identity/Function Problems

*You could try the first few Predicate Logic problems, if you don't mind having variables in there!

Symbol Changes

 Meaning and Argument Twootie Negation ~ ¬ Conditional ⊃ --> Biconditional* ( ⊃ ) & ( ⊃ ) ≡ Negation of Identity ≠ ¬ = Variables** x, y, z, x1,...x2, … w, x, y ,z Predicates*** A1, B1, C1, … A2, … A3, … A, B, C, …

*The biconditional (If and Only If) can be written in terms of two conjoined conditionals, thus Meaning and Argument does not assign it a new symbol (see section 7.10). Thus, "P Q " is equivalent to "(P Q) & (Q P )".

**Variables in Twootie cannot take subscripts.

***Twootie predicates do not take place numbers.

Terminology

 Meaning and Argument Twootie Singular terms Constants Unbound variables Free variables

Truth Tree Rules

 Meaning and Argument Twootie N/A All rules end in "d" or "D" Branches done by hand Automatic Branching: Just enter the first branch's contents and the rule. Quantifier Exchange (QE) `Either ¬∀ or ¬` ∃ Universal Quantifier (UQ) ∀ Existential Quantifier (EQ) ∃ Identity Out (IO) = Identity In (II) No rule -- branch can be closed if it contains, e.g., "Ø a=a" Biconditionals: see below.

Biconditionals

As M&A treats biconditionals as conjoined conditionals, there are no special rules for dealing with them (& and rules are enough). Twootie's bicondional () is a new symbol requiring its own rules:

```P ≡ Q     Ø(P ≡ Q)
/\          / \
P ¬P        P  ¬P
Q ¬Q       ¬Q   Q```

Habits

Twootie doesn't let you take the short cuts that you probably do on paper. Meaning and Argument supports these short cuts, so Twootie will not let you replicate some of the book's solutions exactly. The differences aren't substantial though.

• You must decompose the entire sentence once you've started it. Thus this, e.g., is unacceptable:

1) ~P Premise

2) P & Q Negation of conclusion

3) P 2, &

X

Twootie requires a step 4 before the tree can close:

4) Q 2, &

X

• Double negations must be removed explicitly with the double negation rule (~~ in M&A, ¬ ¬ in Twootie). Meaning and Argument introduces this rule, but it's pretty easy to skip in practice. It's required by Twootie, though.

• Rules can't be applied multiple times in one step. This shows up most frequently with Quantifier Exchanges.Meaning and Argument treats the following inference as acceptable:
1. ~(x)(y)(Q2xy)
2. (x)(y)~(Q2xy) 1, QE twice

Twootie won't let you do this, though. The rule must be applied to the first quantifier, then it must be instantiated before the rule can apply to the second quantifier. For example:

1. ¬ (x)(y)(Qxy)
2. (x)¬ (y)(Qxy) 1, ¬ d (i.e. QE)
3. ¬ (y)(Qay) 2, d (i.e. EQ)
4. (y)¬ (Qay) 3, ¬ d (i.e. QE)

M&A lets you perform all the quantifier exchanges before instantiating; with Twootie, you have to start instantiating before completing the exchanges.

• The Identity Out rule in Twootie (=) works a little differently than in M&A. You can only put the first singular term in place of the second, but not vice versa. So a=b let's us substitute a for b, but not b for a.

Completing the trees

If a branch closes, put an "X" under it. If it is open but complete, hit F10 then use the branch menu to declare it open.

## Chapters 16 & 17

### Chapter 16

Top

A.

#1.

1. (∀x) (B1x ⊃ R2hx)
2. h = a
3. (∀x) (B1x ⊃ R2ax)

#2.

1. (∀x) (D1x ⊃ P2cx)
2. c = d
3. (∀x) (D1x ⊃ P2dx)

B.

 1 (∀x) (F2xa ⊃ (B1x & C1x)) P 2 F2ba P X 3 ~(∃x) (B1x & C1x & x=b) NC 4 (∀x) ~(B1x & C1x & x=b) 3, QE X 5 F2ba ⊃ (B1b & C1b) 1, UQ X 6 ``` / \ ~F``` 2 `ba (B` 1 `b & C` 1 ```b) X | ``` 5, ⊃ 7 B1b 6, & 8 C1b X 9 ~(B1b & C1b & b=b) 4, UQ 10 ``` / | \ ~B``` 1 `b ~C` 1 ```b ~b=b X X |``` 9, ~& twice 11 ``` b=b X``` I I

All branches closed: valid argument

C.

1. (∃x) (P1x & (∃y) (P1y & x ≠y & H1x & H1y))
2. (∀x) (T1x & D1x ⊃ (∀y) (T1y & D1y ⊃ x = y))

D.

1. (∃x) (P1x & L2xs & (∀y) ((P1y & L2ys) ⊃ x=y))
2. (∃x) (P1x & (∀y) (C1y ⊃ E2xy) & (∀z) ((P1x & (∀x1) (C1x1⊃ E2zx1)) ⊃ x1 = z))

E.

#1.

1. (∃x) (M1x & L2xl & (∀y) ((M1y & L2yl) ⊃ x = y) & L1x)
2. (∃x) (M1x & L1x & (∀y) ((M1y & L1y) ⊃ x=y)

#2.

1. (∀x) ((P1x & E1x) ⊃ (∀y) ((P1y & E1y) ⊃ (∀z)((P1z & E1z) ⊃ (x = y v x=z v y=z))))
2. E1n & E1l
3. ~E1m

#3.

1. (∃x) (H1x & H2ax & (∃y) (H1y & H2ay & x≠y))
2. (H1c & H2ac) & (H1k & H2ak)
3. c = k ⊃ (∃x) (H1x & H2ax & x ≠c & x≠k)

### Chapter 17

Top

A.

#1.

1. (∃x) (T2xc & I2xr & A2xt)
2. (∃x) (∃y) (P1y & T2xy & A2xt)

#2.

1. (∃x) (K3xaj &A2xw)
2. (∃x) (∃y) (∃z) (P1y & P1z & K3xyz & A2xw)

B.

#1.

1. (∃x) (S2xm & B1x) & (∃y) (A2ym & R1y)
2. (∃x) (S2xm) & (∃y) (A2ym)

#2.

1. (∃x) (P2xr & H1x) & (∃y) (W2yr & Q1y)
2. ~(∃x) (P2xr & Q1x)

#3.

1. (∃x) (P1x & (∃y) (E2yx & (∀z) (D1z ⊃ O2yz)))
2. (∀x) (E2xa ⊃ (O2xs v O2xw))
3. (∃x) (P1x & (∃y) (E2yx) & x≠a)

C.

#1.

1. (∀x) (∃y) ((P1y & T2xy & R1x) ⊃ (∃z) (P1z & z≠y & (∃x1) (M3x1zy)))
2. (∃x) (T2xl & R1x) ⊃ (∃y) (P1y & (∃z) (M3zyl))

#2.

1. (∃x) (∃y) (∃z) (A3xyz & B1x) ⊃ (∃x1) (∃y1) (P1x1 & C2y1x1)
2. (∃x) (∃y) (∃z) (A3xyz & L1x) ⊃ (∃x1) (∃y1) (P1x1 & L2y1x1 & H1y1)
3. (∃x) (A3xja) ⊃ ((∃y) (∃z) (P1y & C2zy) v (∃x1) (∃y1) (P1x1 & L2y1x1))

Top

## Chapters 7, 9-11

### Chapter 7

A.

1. B ⊃ L
2. R ⊃ J
3. L ⊃ F
4. O ⊃ W
5. B ⊃ F
6. B ⊃ J

B.

1. J ⊃ R
2. R ⊃ A
3. ~H ⊃ L
4. L ⊃ T
5. ~P ⊃ S
6. ~~C ⊃ G

C.

1. (R ⊃ W) & (W ⊃ R)
2. S ∴ ~T
3. D ⊃( C ⊃ E)
4. (O ⊃ C) & (C ⊃ O)
5. (O ⊃ C) & (C ⊃ O)

D.

 P Q (P & Q) ⊃ (P v Q) T T ` T T T ` F T ` F T T ` T F ` F T T ` F F ` F T F `

 P Q R (P v Q) v (~P v R) T T T ` T T T` F T T ` T T T ` T F T ` T T T ` F F T ` F T T ` T T F ` T T F ` F T F ` T T T` T F F ` T T F` F F F ` F T T`

### Chapter 9

Top

A.

1. K1s
2. ∃T1
3. ∀G1
4. F1j
5. W1l
6. ∀S1
7. ∃R1

B.

1. Something is a sheep
2. Something is a yellow dog.
3. Something is either tall, or a sheep.

### Chapter 10

Top

A.

#1.

 X 1 ∃(S1 & J1) P 2 ∀(J1 ⊃ L1) P X 3 ~∀(S1 ⊃ L1) NC X 4 ∃~(S1 ⊃ L1) 3, QE X 5 ~(S1a ⊃L1a) 4, EQ X 6 S1b & J1b 1, EQ X 7 J1a ⊃ L1a 2, UQ X 8 J1b ⊃ L1b 2, UQ 9 S1a 5,~⊃ 10 ~L1a 11 S1b 6, & 12 ` J` 1 `b` 13 ``` / \ ~J``` 1 `a L` 1 ```a | X ``` 7, ⊃ 14 ` / \~J` 1 `b L` 1 ```b X O``` 8, ⊃

Open branches: invalid argument

#2.

 X 1 M1a & N1a P X 2 ∃(M1 & J1) P X 3 ~∃(J1 & N1) NC 4 ∀~(J1 & N1) 3, QE X 5 M1b & J1b 2, EQ X 6 ~(J1a & N1a) 4, UQ X 7 ~(J1b & N1b) 4, UQ 8 M1a 1, & 9 N1a 10 M1b 5, & 11 ` J` 1 `b` 12 ` / \~J` 1 `a ~N` 1 ```a | X``` 6, ~& 13 ` / \~J` 1 `b ~N` 1 ```b X O``` 7, ~&

Open branches: invalid argument

#3.

 X 1 K1a & B1b P X 2 ∃(K1 & D1) P 3 ∀(D1 ⊃ B1) P X 4 ~(B1a v K1b) NC X 5 K1c & D1c 2, EQ X 6 D1a ⊃ B1a 3, UQ X 7 D1b ⊃ B1b 3, UQ X 8 D1c ⊃ B1c 3, UQ 9 K1a 1, & 10 B1b 11 K1c 5, & 12 D1c 13 ~B1a 4, ~v 14 ` ~K1b` 15 ` / \~D` 1 `a B` 1 ```a | X``` 6, ⊃ 16 ` / \~D` 1 `c B` 1 ```c X |``` 8, ⊃ 17 ``` / \ ~D``` 1 `b B` 1 ```b O O ``` 7, ⊃

Open branches: invalid argument

### Chapter 11

Top

1. ∀((P1 & S1) ⊃ L1)
2. ∃(P1 & M1) ⊃ M1l
3. ∀(F1 ⊃ C1)
4. ∀ ((P1 & T1) ⊃ D 1)
5. ∃(P1 & L1) ⊃ ∀(P1 ⊃ L1)

## Chapters 12-15

### Chapter 12

A.

1. (∀x) (P1x ⊃ L2xr)
2. (∃x) (L2jx) v (∃y (F2jy)
3. (∃x) (P1x & S2jx)
4. (∃x) (M1x & S2dx)
5. (∀x) (S1x ⊃ T3axt)

B.

#1.

1. (∀x) (B1x ⊃ H2rx)
2. B1f
3. ∴ H2rf

#2.

1. (∃x) (C1x & B3nxr)
2. ∴ (∃x) (C1x & H2rx)

#3.

1. K3ceb
2. ∴(∃x) (P1x & K3cxb) & (∃y) (P1y & K3yeb)

### Chapter 13

Top

A.

1. (∃x) (P1x & (∀y) (P1y ⊃ L2xy))
2. (∃x) (P1x & (∀y) (P1y ⊃ L2yx))
3. (∃x) (M1x & (∀y) (B1y ⊃ (∀z) (L1z ⊃ P3yzx)))
4. (∃x) (G1x & ~(∃y) (B1y & (∀z) (P1z ⊃ P3xyz)))
5. (∀x) (D1x ⊃ (∃y) (S1y & (∃z) (P1z & W3yxz)))
6. (∃x) (B1x & (∃y) (S1y & (∀z) (T1z ⊃ R3yxz)))
7. (∃x) (C1x & ∀y) (P1y ⊃∀z) (D1z ⊃ S3yxz)))

B.

#1.

1. (∀x) (L1x ⊃ (∃y) (F1y & (∃z) (T1z & P3xyz)))
2. (∃x) (L1x)
3. ∴ (∃x) (F1x & (∃y) (T1y & (∃z) (L1z & P3zxy)))

#2.

1. (∃x) (P1x & (∀y)) (T1y ⊃ (∃z) (F1z & E3xzy)))
2. ∴ (∀x)) (T1x ⊃ (∃y) (F1y & (∃z) (P1z & E3zyx)))

#3.

1. (∃x) (T1x & (∀y) (C1y ⊃ (∃z) (G1z & ~C3yxz))) (This sentence is ambiguous; if you think the sentence can be true if one or two cats climb the tree -- as long as not ALL cats do so -- then you might be inclined to symbolize it as follows: (∃x) (T1x & ~(∀y) (C1y ⊃ (∃z) (G1z & C3yxz))) )
2. ∴ (∀x) (C1x ⊃ (∃y) (G1y & (∃z) (T1z & C3xzy)))

#4.

1. (∀x) (L1x ⊃ (∃y) (T1y & (∀z) (W1z ⊃ L3yxz)))
2. (∃x) (L1x)
3. ∴(∃x) (L1x & (∀y) (W1y ⊃ (∃z) (T1z & C3zxy)))

### Chapter 14

Top

A.

#1.

 1 (∀x) (B1x ⊃H2rx) P 2 B1f P 3 ~H2rf NC X 4 B1f ⊃ H2rf 1, UQ 5 ``` / \ ~B``` 1 `f H` 2 ```rf X X``` 4, ⊃

All branches close: valid argument.

#2.

 X 1 (∃x) (C1x & B3nxr) P X 2 ~(∃x) (C1x & H2rx) NC 3 (∀x) ~ (C1x & H2rx) 2, QE X 4 C1a & B3nar 1, EQ X 5 ~ (C1a & H2ra) 3, UQ 6 C1a 4, & 7 B3nar 8 ``` / \ ~C``` 1 `a ~H` 2 ```ra X O ``` 5, ~&

Open branch: invalid argument

### Chapter 15

Top

A.

1. ~(∃x) (P1x & (∀y) (T1y ⊃ H2xy))
2. ~(∃x) (P1x & ~(∃y) (T1y & H2xy))
3. (∃x) (C1x & (∀y) (G1y ⊃ ~E2xy))
4. (∀x) (C1x ⊃ ~(∃y) (G1y & E2xy))

B.

#1.

1. (∀x) (H1x ⊃ (∃y) (P1y & ~(∃z) (N1z & C3xyz)))
2. (∀x) (H1x ⊃ A1x)
3. ∴ ~( (∀x) (A1x ⊃ (∃y) (P1y & (∃z) (P1z & C3xyz))))

#2.

1. ~(∃x) (D1x & B1x)
2. (∀x) (D1x v A1x)
3. (∃x) (P1x & ~A1x)
4. ∴~(~(∃x) (P1x & ~B1x))

C.

1. (∀x) ( (∃y) (F1y & H2xy) ⊃ C1x)
2. (∀x) ((∃y) (W1y & B2xy) ⊃ F1x)
3. (∀x) (P1x ⊃ ((∀y) (B2xy ⊃ A1y))
4. ~((∀x) ((∀y) (S2xy ⊃ B1y ) ⊃ S1x)

D.

#1.

1. (∀x) ((∃y) (T1y & C2xy) ⊃ C1x)
2. (∀x) ((∃y) (S1y & A2xy) ⊃ (∃z) (T1z & C2xz))
3. ∴ (∀x) ((∃y) (S1y & A2xy) ⊃ C1x)

#2.

1. (∀x) ((∀y) (L2xy ⊃ L1y) ⊃ T1x)
2. (∃x) (P1x & (∃y) (B1y & L2xy))
3. ∴ ~(∀x) (P1x ⊃ T1x)

E.

#1

1. (∀x) (P1x ⊃ ((∀y) (C1y ⊃ (O2xy ⊃ B2xy))))
2. (∀x) ((C1x & (∃y) (P1y & B2yx)) ⊃ S1x)
3. (∀x) ((C1x & (∃y) (P1y & B2yx)) ⊃S1x)

#2.

1. (∀x) (B1x ⊃ ((∀y) (A1y ⊃ (M2xy ⊃ R2xy))))
2. B1s & A1h
3. M2sh ⊃ R2sh

#3.

1. (∀x) (P1x ⊃ ((∀y) (F1y ⊃ (S2xy ⊃ K2xy))))
2. ~(∀x) (F1x ⊃ ((∀y) (P1y ⊃ (K2yx ⊃ S2yx))))
3. (∃x) (P1x & (∃y) (F1y & S2xy & ~K2xy))

F.

#1-#4: see M&A solutions

#5.

1. (∀x) (C1x ⊃ ((∀y) (M1y ⊃ (C2xy ⊃ E2xy))))
2. (∀x) ((∃y) (M1y & E2xy) ⊃ ~H1x)
3. ~(∃x) (C1x & (∃y) (M1y & C2xy) & H1x)

#6.

1. (∀x) ((P1x & F1x) ⊃ (∀y) (P1y ⊃ L2yx))
2. (∀x) (P1x ⊃ (∃y) (P1y & ~L2yx)
3. ~(∃x) (P1x & F1x)

#7.

1. ~(∃x) (P1x & (∃y) (D1y & P2xy) & U1x)
2. ~(∀x) (P1x ⊃ (∃y) (D1y & P2xy))
3. ~ (∀x) (P1x ⊃ (∃y) ((D1y &P2xy) ⊃ ~U1x))

#8.

1. (S1j ⊃ (∀x) (B1x ⊃ P1x)) & ((∀y) (B1y ⊃ P1x) ⊃ S1j)
2. (∃x) (T1x & M2jx) ⊃ (∀x) (B1x ⊃ ~P1x)
3. ~(∃x) (T1x & M2jx) ⊃ A1j
4. ~A1j ⊃ ~S1j

#9.

1. ~(∃x) (P1x & (∀y) (T1y ⊃ (~S2xy & W2xy))
2. ~(∃x) (P1x & (∀y) (T1y ⊃ ~W2xy) & (∀z) (C1z ⊃ W2xz))
3. (∀x) ((P1x & (∀y) (C1y ⊃ W2xy)) ⊃ (∀z) (T1z ⊃ S2xz))

Top

Chapters: | 1 | 2 | 3 | 4 | 5| 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 |

The best way to learn logic is through practice; below are additional exercises for the more difficult chapters. Follow the links above for solutions.

### Chapter 7

When to try: After sect 7.5 Necessary and Sufficient Conditionals, p.88

A. Statements

• Symbolize (1)-(5) in PL using the dictionary provided.

1) If the book gets published, then Lucy will throw a party. (B: The book gets published; Lucy throws a party)

2) If Rachel gets an ‘A’, Joan will be pleased. (R: Rachel gets an A; J: Joan is pleased)

3) Mary will feed you if she likes you. (F: Mary feeds you; L: Mary likes you)

4) Wearing clothes is necessary for going outside. (W: you wear clothes; O: you go outside)

5) Bribing the judge is sufficient for going free. (B: you bribe the judge; F: You go free)

6) John’s cooking dinner is necessary for Bill’s being happy. (J: John cooks dinner; B: Bill is happy)

When to try: After sect 7.7 Unless, p.92

B. Statements

• Symbolize (1)-(6) in PL using the dictionary provided.

1) Joe will wear is hat only if it rains. (J: Joe wears his hat; R: it rains)

2) Susan will be rich only if her aunt dies. (R: Susan will be rich; A: Susan’s aunt dies)

3) I will live to be 100 unless I get hit by a sugar-crazed New York City taxi driver. (L: I will live to be 100; H: I get hit by a sugar-crazed New York City taxi driver)

4) Laura will get an ‘A’ only if she buys the teacher an apple. (L: Laura gets an 'A'; T: Laura buys the teacher an apple)

5) Jerry will be sad unless his paper gets published. (S: Jerry is sad; P: Jerry's paper gets published)

6) Unless I didn’t count correctly, there are three hundred cabbages in this garden. (C: I counted correctly; G: there are three hundred cabbages in this garden)

When to try: After sect 7.10 If and Only If, p.94

C. Statements

• Symbolize (1)-(5) in PL using the dictionary provided.

1) Nadia relaxes if and only if all her work is done. (R: Nadia relaxes; W: All Nadia’s work is done)

2) Since I went to the store, I will not run out of toothpaste. (S: I went to the store; T: I will run out of toothpaste)

3) If you eat your dinner, then if there’s cake in the house, you can eat desert. (D: you eat your dinner; C: there’s cake in the house; E: you can eat desert)

4) You can go out if and only if you clean your room. (O: You can go out; C: you clean your room)

5) Cleaning your room is necessary and sufficient for going out.

When to try: Add to Ex. 6, p. 108

D. Truth Tables

• Determine if the following statements are contradictions, tautologies, or contingent using the truth table method.

6. (P & Q) (P v Q)

7. (P v Q) v (~P v R)

When to try: Add to Ex.7, p.109

E. Truth Tables

• Determine whether the set of statements is consistent

3. {(P (Q & R)) & S, ~(T v R) & (S P)}

### Chapter 9

Top

When to try: After 9.4 Quantifiers, p. 140

A. Statements

• Symbolize (1)-(7) in PPL using the dictionary provided.

1) Susan is kind. (K1: is kind; s: Susan)

2) Something tastes sweet. (T1: tastes sweet)

3) Everything is good. (G1: is good)

4) John is funny. (F1: is funny; j: John)

5) Lucy works hard. (W1: works hard; l: Lucy)

6) Everything smiles a lot. (S1: smiles a lot)

7) Something is rooster. (R1: is rooster)

When to try: add to Ex 1, p. 143

B. Representations

• What English sentences might these represent?

6. S1

7. (D1 & Y1)

8. (T1 v S1)

### Chapter 10

Top

When to try: Add to Ex. 2, p. 167

A. Truth Trees

• Construct truth trees for the following.

11) (S1 & J1), (J1 L1), (S1 L1)

12) M1a & N1a, (M1 & J1), (J1 & N1)

13) K1a & B1b, (K1 & D1), (D1 B1), B1a v K1b

### Chapter 11

Top

When to try: After 11.4 Pronouns Revisited, p. 178

A. Statements

• Symbolize (1)-(5) in PPL using the dictionary provided.

1) Anyone who can sing is lucky. (S1: can sing; L1: is lucky)

2) If anyone will be a millionaire, Laura will be a millionaire. (M1: is a millionaire; l: Laura)

3) If something is frozen, it is cold. (F1: is frozen; C1: is cold)

4) If someone touches the gold, he will die. (P1: is a person; T1: touches the gold; D1: dies)

5) If anyone can laugh, then everyone can laugh. (P1: is a person; L1: can laugh)

### Chapter 12

Top

When to try: After Chapter 12, p. 204

A. Statements

• Symbolize (1)-(5) in RPL using the dictionary provided.

1) Everyone likes Rebecca. (P1:is a person; L2:likes; r: Rebecca)

2) Either John lost something, or John found something. (L2:lost; F2:found; j: John)

3) Joan sang to someone. (P1:is a person; S2: sang to; j: Joan)

4) There’s a mat that Domino the cat sat on. (S2:sits on; M1: is a mat; d: Domino the cat)

5) Alan teaches every student on Tuesday. (T3:_teaches_on _; S1: is a student; a:Alan; t:Tuesday)

When to try: After Chapter 12, p. 204

B. Arguments

• Symbolize arguments (1)-(3) in RPL using the dictionary provided.

1) Rachel has every Beanie Baby. Flip is a Beanie Baby. So, Rachel has Flip. (H2has; B1:is a Beanie Baby; r:Rachel; f:Flip)

2) Nadia bought her roommate a chicken. Hence, Nadia’s roommate has a chicken. (n:Nadia; r:Nadia’s roommate; C1: is a chicken; B3: _bought_for_; H2:has)

3) Carly kissed Erik in Boston. So, Carly kissed someone in Boston and someone kissed Eric in Boston. (K3:_kissed_in_; c: Carly; e:Erik; b:Boston)

### Chapter 13

Top

When to try: Change Ex. 5, p. 225. Don't worry about #5, 6, 7, 8, 9, 10, or 11 -- try these instead!

A. Statements

5) Someone likes everyone.

6) Someone is liked by everyone.

7) Some mailbox is such that every boy put every letter in it. [P3:_put_ into_; B1: is a boy; L1: is a letter; M1: is a mailbox]

8) Some girl didn’t push a boy into every puddle. [P3:_push_ into_; G1: is a girl; P1: is a puddle]

9) Every dog had some student walk it in a park. [W3:_walked_in_; D1 is a dog; S1: is a student; P1: is a park]

10) Some book has a student reading it at all times. [R3:_ reads_at _; B1: is a book; T1: is a time]

11) There’s a conundrum that every professor struggled over every day. [S3:_ struggled over_on_; C1: is a conundrum; P1: is a professor; D1: is a day]

When to try: Instead of Ex. 6, p. 225

B. Arguments

1) Every living organism must perform a life function at some time. There are living organisms. Therefore, there’s some life function which at some time has a living organism performing it. [P3:_ performs_at_; L1: is a living organism; F1: is a life function; T1: is a time]

2) Someone is always eating some food. So, at all times, some food is being eaten by someone. [E3:_eats_at_; P1: is a person; F1: is a food; T1: is a time]

3) At least one tree isn’t climbed up by every cat in a garden. So, for every cat, there’s a garden in which there’s a tree that she climbs up. [C3:_ climbs up _in_; T1: is a tree; C1: is a cat; G1: is a garden]

4) Every leaf is lost by some tree every winter. There are leafs. Thus, some leaf is such that every winter some tree loses it. [L3:_loses_in_; L1:is a leaf; W1:is a winter; T1:is a tree]

### Chapter 14

Top

When to try: After Chapter 14, p.238

A. Truth Trees

• Determine the validity of the arguments you symbolized in Chapter 12 additional exercises.

1) Rachel has every Beanie Baby. Flip is a Beanie Baby. So, Rachel has Flip. (H2has; B1:is a Beanie Baby; r:Rachel; f:Flip)

2) Nadia bought her roommate a chicken. Hence, Nadia’s roommate has a chicken. (n:Nadia; r:Nadia’s roommate; C1: is a chicken; B3: _bought_for_; H2:has)

3) Carly kissed Erik in Boston. So, Carly kissed someone in Boston and someone kissed Erik in Boston. (K3:_kissed_in_; c: Carly; e:Erik; b:Boston)

### Chapter 15

Top

When to try: Add to Ex. 1, p. 240

A. Statements

3) No one is happy always. [H2: is happy at; T1: is a time; P1: is a person]

4) No one is never happy.

5) Some cow doesn’t eat grass. [E2:eats; C1: is a cow; G1: is grass]

6) Every cow eats no grass.

When to try: Add to Ex 2, p. 240

B. Arguments

3) All hydrogens have a proton, but not a neutron. All hydrogens are atoms. So, it’s not true that all atoms have protons and neutrons. [C3:_have_and_; H1: is a hydrogen; P1: is a proton; N1: is a neutron; A1: is an atom]

4) Nothing dead breathes. Everything is either dead or alive. Some people are not alive. So it’s false that no one doesn’t breathe.

When to try: Add to Ex. 3, p. 242

C. Statements

1) Only cats have fur. [H2:_has_; C1: is a cat; F1: is fur]

2) Only fish can breathe under water. (B2: can breathe under; F1: is a fish; W1: is water]

3) Everyone can breathe only air. [B2:can breathe; P1: is a person; A1: is air]

4) Not only students study only books. [S2:studies; S1: is a student; B1: is a book]

When to try: Add to Ex 4, pp.242-243

D. Arguments

3) Only cats climb trees. Only tree climbers catch squirrels. So, only cats catch squirrels. [C2:climbs; A2: catches; C1: is a cat; S1: is a squirrel; T1: is a tree]

4) Only trees lose only leaves. Some people lose books. Thus, not every person is a tree. [L2: loses; T1: is a tree; L1: is a leaf: B1: is a book: P1: is a person]

When to try: Add to Ex. 11, p.254

E. Arguments

3) Everyone who owns a cat brushes it. Each cat that is brushed by someone is silky. Therefore, every owned cat is silky. [O2:_owns_; B2:_brushes_; P1: is a person; C1; is a cat; S1: is silky]

4) Any strong base that mixes with a strong acid reacts with it. Sodium hydroxide is a strong base and hydrogen chloride is a strong acid. Thus, if sodium hydroxide mixes with hydrogen chloride, it will react with it. [M2:_mixes with_; R2:_reacts with_; A1: is a strong acid; B1: is a strong base; s: sodium hydroxide; h: hydrogen chloride]

5) Anyone that sits on a flea kills it. But not every flea that is killed by someone is sat on (by him). So, there’s someone who sat on a flea and didn’t kill it. [P1: is a person; S2:sits on; K2:_kills; F1: is a flea]

When to try: After Chapter 15, p. 257

F. Arguments

1) P. 254 Ex 11 #1

2) p. 254 Ex 11 #2

3) p. 225 Ex 6 #1

4) p. 225 Ex 6 #2

5) Whenever a cat catches a mouse, he’ll eat it. Mouse eaters will not go hungry. So, no cat that catches a mouse goes hungry. [C2: catches; C1: is a cat; M1: is a mouse; E2: eats; H1: goes hungry]

6) Only people who are loved by everyone are perfect. Everyone has someone who doesn’t love him. Thus, it follows that nobody is perfect. [L2: loves; P1: is a person; F1: is perfect]

7) No one is unhappy who plays with a dog. Not everyone has a dog he plays with. Thus, it’s not the case that everyone who plays with a dog is not unhappy. [P1: is a person; U1: is unhappy; P2:plays with; D1: is a dog]

8) John is successful if and only if all his books are published. If he made typos, his books will not be published. Being accurate is necessary for not making typos. Therefore, if John is not accurate, he will not be successful. [S1: is successful; P1: is published; B1: is a book of John; j:John; T1: is a typo; M2:made; A1: is accurate]

9) No one who does not study for tests will do well on them. No one who doesn’t do well on tests will do well in courses. So, only people who study for tests will do well in courses. [P1: is a person; T1: is a test; S2:studies for; C1: is a course; W2:does well in]

### Chapter 16

Top

When to try: Add to Exercise 1, pp.260-261

A. Arguments

3) Hydrogen chloride reacts with every base. Hydrogen chloride is the same as hydrochloric acid. So, hydrochloric acid reacts with every base. (R2: reacts with; B1: is a base; h: hydrogen chloride; a: hydrochloric acid)

4) Alan’s cat purrs everyday. Alan’s cat is Domino. Thus, Domino purrs everyday. (c: Alan’s cat; d: Domino; D1: is a day; P2:purrs on)

When to try: Add to Exercise 3, p. 264

B. Truth Trees

6. (x)(F2xa (B1x & C1x)); F2ba; (x)(B1x & C1x & x = b)

When to try: Before Ex. 5, p. 273

• Solve for (1)-(4), using the dictionary provided.

1) At least two people are happy. (P1: is a person; H1: is happy)

2) No more than one turkey will die. (T1: is a turkey; D1: will die)

When to try: After Ex. 6, p. 274.

D. Statements

• Symbolize in RPL=, using the dictionary provided.

1) Susan is loved by exactly one person (L2: loves; s: Susan; P1:is a person)

2) Exactly one person ate every cabbage. (E2: eats; C1: is a cabbage.)

When to try: After Chapter 16, p. 282

E. Arguments

• Symbolize in RPL=, using the dictionary provided.

1) The only man who loves Lucy left. So, exactly one man left. (L2: loves; L1: left; M1: is a man; l: Lucy)

2) No more than two people are eligible. Nadia is eligible, and so is Laura. Therefore, Mike is not eligible. (E1:is eligible; P1: is a person; n: Nadia; l: Laura; m: Mike)

3) Anna has at least two husbands. Craig is her husband and Ken is her husband. Thus, if Craig and Ken are the same person, Anna has another husband. (H2:has; H1: is a husband; c: Craig; k: Ken)

### Chapter 17

Top

When to try: After 17.3, p. 293

A. Arguments

• Symbolize in RPL=, using the dictionary provided.

1) Carly talked in her room at 3:00 am. So, someone was talking at 3:00 am. (T2:is a talking by; I2: occurs in; A2: occurs at; c: Carly; t:3:00 am; r: Carly's room)

2) Alex killed John last week. Thus, someone killed someone last week. (K3:_is a killing by_ of _; A2: occurs at; a: Alex; j: John; w: last week)

When to try: After 17.4 Adverbial Modification, p. 295

B. Arguments

• Symbolize arguments (1)-(3) into RPL=, using the dictionary provided.

1) Maria sang beautifully and acted brilliantly. So, Maria sang and acted. (S2: is a singing by; A2: is an acting by; B1: is beautiful; R1: is brilliant; m: Maria)

2) Rachel played happily and worked quietly. So, it’s not the case that Rachel played quietly. (P2: is a playing by; W2: is a working by; H1: is happy; Q1:is quiet; r: Rachel)

3) Someone exercises everyday. Alan exercises only on Saturday and Wednesday. Therefore, there is someone who exercises that is not Alan. (P1:is a person; E2: is an exercising by; O2:occurs on; H1:is happy; a: Alan; D1: is a day; O2: occurs on; s: Saturday; w: Wednesday)

When to try: Add to Exercise 2, pp. 297-298.

C. Arguments

• Symbolize, using the conventions recommended by the event approach, arguments (1)-(2) in RPL=.

1) Whenever someone talks rapidly, someone else misunderstands him. So, if Lisa talks rapidly, someone will misunderstand her. (T2:is a talking by; M3:_is a misunderstanding by_of _; R1:is rapid; P1:is a person; l:Lisa)

2) If there is a big argument, someone will cry. If there is a little argument, someone will laugh heartily. So, if Jerry argues with Alison, then either someone will cry or someone will laugh. (A3:_is an arguing by_with_; B1:is big; L1:is little; H1:is hearty; C2:is a crying by; L2:is a laughing by)