CS计算机代考程序代写 73 (whodunit) Here are ten statements.

73 (whodunit) Here are ten statements.
(i) Some criminal robbed the Russell mansion.
(ii) Whoever robbed the Russell mansion either had an accomplice among the servants or had
to break in.
(iii) To break in one would have to either smash the door or pick the lock.
(iv) Only an expert locksmith could pick the lock.
(v) Anyone smashing the door would have been heard.
(vi) Nobody was heard.
(vii) No one could rob the Russell mansion without fooling the guard.
(viii) To fool the guard one must be a convincing actor.
(ix) No criminal could be both an expert locksmith and a convincing actor.
(x) Some criminal had an accomplice among the servants.
(a) Choosing good abbreviations, translate each of these statements into formal logic. § Here are some abbreviations.
Cx = ( x is a criminal)
Rx = ( x robbed the Russell mansion)
Sx = ( x had an accomplice among the servants) Bx = ( x broke in)
Dx = ( x smashed the door)
Px = ( x picked the lock)
Lx = ( x is an expert locksmith)
Hx = ( x was heard)
Fx = ( x fooled the guard)
Ax = ( x is a convincing actor)
Now the statements are formalized as follows.
(i) ∃x·Cx∧Rx
(ii) ∀x·Rx⇒Sx∨Bx
(iii) ∀x·Bx⇒Dx∨Px
(iv) ∀x·Lx⇐Px
(v) ∀x·Dx⇒Hx
(vi) ¬∃x· Hx
(vii) ¬∃x· Rx ∧ ¬Fx
(viii) ∀x· Fx ⇒ Ax
(ix) ¬∃x· Cx ∧ Lx ∧ Ax
(x) ∃x· Cx ∧ Sx
(b) Taking the first nine statements as axioms, prove the tenth. § Lemma:
T
= ¬∃x· Rx ∧ ¬Fx
= ∀x· ¬(Rx ∧ ¬Fx)
= ∀x· ¬Rx ∨ ¬¬Fx
= ∀x· ¬Rx ∨ Fx
= ∀x·Rx⇒Fx Now the main proof:
T
= ∃x· Cx ∧ Rx
= ∃x· Cx ∧ Rx ∧ Rx
⇒ ∃x· Cx ∧ Fx ∧ (Sx ∨ Bx)
⇒ ∃x· Cx ∧ Ax ∧ (Sx ∨ Dx ∨ Px)
(vii) duality (deMorgan) duality (deMorgan) double negation material implication
(i) idempotence lemma and (ii) (viii) and (iii) (v) and (iv)

⇒ ∃x·Cx∧Ax∧(Sx∨Hx∨Lx)
= ∃x· Cx ∧ Ax ∧ Sx ∨ Cx ∧ Ax ∧ Hx ∨
= ∃x· Cx ∧ Ax ∧ Sx ⇒ ∃x·Cx∧Sx
Cx ∧ Ax ∧ Lx
distribute (vi) and (ix) specialize