Multiple Choice
select the best translation into predicate logic, using the following translation key:
a: one
b: two
c: three
f(x) : the successor of x
g(x,y) : the sum of x and y
Nx: x is a number
Dxy: x is divisible by y
Gxy: x is greater than y
-Numbers that are not divisible by three have sums with themselves that are also not divisible by three.
A) (∀x) [(Nx • ∼Dxc) ⊃ ∼Dg(x,x) c]
B) (∀x) [(Nx ⊃ ∼Dxc) ⊃ ∼Dg(x,x) c]
C) (∀x) [(Nx • ∼Dxc) ⊃ Dg(x,x) b]
D) (∀x) [(Nx • ∼Dcx) ⊃ ∼Dg(x,x) c]
E) (∃y) (∀x) [(Nx • ∼Dcx) ⊃ ∼Dg(x,x) y]
Correct Answer:

Verified
Correct Answer:
Verified
Q77: select the best translation into predicate logic,
Q78: select the best translation into predicate logic,
Q79: construct a model for each of the
Q80: use:<br>b: Britain <br>c: Charles <br>e: Elizabeth <br>t:
Q81: construct a model for each of the
Q83: select the best translation into predicate logic,
Q84: 1. (∀x)[(Hx • x≠a) ⊃ Jax]<br>2. Hb
Q85: All philosophers respect each other. Some
Q86: 1. (∀x)(∀y)(∀z)[(Pxy • Pyz) ⊃ Pxz]<br>2. (∀x)Pxf(x)<br>-Which
Q87: select the best translation into predicate