I.

Let the universe be all real numbers, determine whether the

following sentences are true or false.
1. (∀x) (x + x ≥ x) 5. There is a smallest positive integer. (Real numbers)
False, because if x is a negative number, x + x will now be less than or
equal to x.
III. Construct a formal proof of validity for the following arguments:
2. (Ǝx) (3x = x2) 1. (∀x)(Ax  Bx)
(∀x)(Cx  Bx)
3. (Ǝx) (3x = x) ∴ (∀x)[(Ax  Cx)  Bx]

4. (∀x) (x2 + 4x + 5 ≥ 0) 1 (∀x)(Ax  Bx) Given

True, because it works for integers and all real numbers. 2 (∀x)(Cx  Bx) Given / ∴ (∀x)[(Ax 
Cx)  Bx]
3 Aa  Ca RCP Assumption
II. Translate the following English sentences into symbolic sentences 4 Aa RCP Assumption
with quantifiers. The universe for each is given in the parenthesis. 5 Aa  Ba 1, UI
Then, write a useful denial, and give translation in ordinary English. 6 Ca  Ba 2, UI
1. Not all precious stones are beautiful. 7 Ba 5, 4, MP
Symbolic Sentence: (∀x)[~(Px  Bx)] 8 (Aa  Ca)  Ba 3-7 RCP
Denial: (Ǝx)(Px ^ ~Bx) 9 (∀x)[(Ax  Cx)  Bx] 8, UG
Ordinary English: Some precious stones are not beautiful.

2. All precious stones are not beautiful. (All stones) 2. (∀x)(Dx  ~Ex)
Symbolic Sentence: (∀x)(Px  ~Bx) (Ǝx)(Fx  Ex)
Denial: (Ǝx)(~Px  Bx) ∴ (Ǝx)(Fx  ~Dx)
Ordinary English: Some precious stones are beautiful.
1 (∀x)(Dx  ~Ex) Given
3. Some isosceles triangle is a right triangle. (All triangles) 2 (Ǝx)(Fx  Ex) Given / ∴ (Ǝx)(Fx  ~Dx)
Symbolic Sentence: (Ǝx)(Ix ^ Rx) 3 Fa RCP Assumption
Denial: (∀x)(Ix  ~Rx) 4 Da  ~Ea 1, UI
Ordinary English: All isosceles triangles are not right triangles. 5 Fa  Ea 2, EI
6 Ea 5, 3, MP
4. No right triangle is isosceles. (All triangles) 7 Ea  ~Da 4, TRANS
Symbolic Sentence: (∀x)(Rx  ~Ix) 8 ~Da 7, 6, MP
Denial: (Ǝx)(Rx ^ Ix) 9 Fa  ~Da 3-8 RCP
Ordinary English: Some right triangle is isosceles. 10 (Ǝx)(Fx  ~Dx) 9, EG
3. (∀x)(Gx  Hx)
(Ǝx)(Gx v Hx) 5. All professors are learned. All learned professors are savants.
∴ (Ǝx)(Hx) Therefore, all professors are learned savants. (Px, Lx, Sx)
1 (∀x)(Px  Lx) Given
1 (∀x)(Gx  Hx) Given 2 (∀x)[(Px ^ Lx)  Sx] Given / ∴ (∀x)[Px  (Lx ^ Sx)]
2 (Ǝx)(Gx v Hx) Given / ∴ (Ǝx)(Hx) 3 Pa RCP Assumption
3 Ga  Ha 1, UI 4 Pa  La 1, UI
4 Ga v Ha 2, EI 5 (Pa ^ La)  Sa 2, UI
5 ~Ha RIP Assumption 6 La 4, 3, MP
6 Ha v Ga 4, COMM 7 Pa ^ La 3, 6, CONJ
7 Ga 6, 5, DS 8 Sa 5, 7, MP
8 Ha 3, 7, MP 9 La ^ Sa 6, 8, CONJ
9 Ha ^ ~Ha 8, 5, CONJ 10 Pa  (La ^ Sa) 3-9 RCP
11 (∀x)[Px  (Lx ^ Sx)] 10, UG

4. (∀x)[Ix  (Jx  Kx)] 6. All diplomats are public servants. Some diplomats are eloquent. All
(∀x)[Kx  (Lx ^ Mx)] eloquent public servants are orators. Therefore, some diplomats are
∴ (∀x)[Ix  (Jx  Lx)] orators. (Dx, Px, Ex, Ox)
1 (∀x)(Dx  Px) Given
1 (∀x)[(Ix  (Jx  Kx)] Given 2 (Ǝx)(Dx ^ Ex) Given
2 (∀x)[Kx  (Lx  Mx)] Given / ∴ (∀x)[Ix  (Jx  Lx)] 3 (∀x)[(Ex ^ Px)  Ox] Given / ∴ (Ǝx)(Dx ^ Ox)
3 Ia RCP Assumption 4 Da  Pa 1, UI
4 Ja RCP Assumption 5 Da ^ Ea 2, EI
5 Ia  (Ja  Ka) 1, UI 6 (Ea ^ Pa)  Oa 3, UI
6 Ka  (La ^ Ma) 2, UI 7 Da 5, SIMP
7 Ja  Ka 5, 3, MP 8 Pa 4, 7, MP
8 Ka 7, 4, MP 9 Ea ^ Da 5, COMM
9 La ^ Ma 6, 8, MP 10 Ea 9, SIMP
10 La 9, SIMP 11 Ea ^ Pa 10, 8, CONJ
11 Ja  La 4-10, RCP 12 Oa 6, 11, MP
12 Ia  (Ja  La) 3-11, RCP 13 Da ^ Oa 7, 12, CONJ
13 (∀x)[Ix  (Jx  Lx)] 12, UG 14 (Ǝx)(Dx ^ Ox) 13, EG