I needs a few Proofs completed for a Logic course. The Proofs must be solved by Natural Deduction. Specifically, ONLY the following rules must be used to complete each proof: Modus Pollens, Modus Tollens, Hypothetical Syllogism, Disjunctive Syllogism, Constructive Dilemma, Simplification, Conjunction, DeMorgan's Rule, Addition, Commutativity, Associativity, Distribution, Double Negotiation, Transposition, Material Implication, Material Equivalence, Exportation, Tautology, Universal Instantiation, Universal Generalization, Existential Instantiation, Existential Generalization, Change of Quantifier.
Here is an example problem:
1. Ez(Cz) > z(Nz)
2. (Ez) ~Nz
/ z ~(Cz)
Each and every step must be written out, along with each line used and rule used. A completed problem should look something like this:
1.N> [(N*O) > P]
2 N*O
// P
3. N 2 Simp
4 ( N*O)>P 1,3 MP
5 P 2,4 MP
If you are interested, please solve the first example problem and send the completed proof in a message. I will then plug it into the software to make sure that the proof is indeed correct and in appropriate form. If it is, I am paying you to complete 9 additional proofs. The proofs must be completed no later by 6 pm Sunday (4/14/13)