Hien B. answered • 04/18/19
Top Logic Tutor w/ Master's degree from Oxford
- (J v A) > [(S v K) > (~I • Y)]
- (~I v ~M) > E
3. J Assume for Conditional Introduction
4. S Assume for Conditional Introduction
5. J v A 3, Disjunction Introduction
6. (S v K) > (~I • Y) 1, 5, Modus Ponens
7. S v K 4, Disjunction Introduction
8. ~I • Y 6, 7, Modus Ponens
9. ~I 8, Conjunction Elimination
10. ~I v ~M 9, Disjunction Elimination
11. E 2, 10, Modus Ponens
12. S > E 4-11, Conditional Introduction
13. J > (S > E) 3-12, Conditional Introduction
Hope that helps! Feel free to contact me if you'd like more help with logic, or if you'd like an explanation for what I did here!
Emma K.
The rules I am to use are Modus Ponens, Modus Tolens, Hypothetical Syllagism, Disjunctive Syllagism, Simplification, Conjunction, Add, Constructive Dilemma, Double Negation, DMorgans, Commutative, Associative, Distribution, Transposition, Implication, Exportation, Tautology, and Equivalence.04/18/19
Hien B.
Disjunction Introduction is another name for Addition. Sometimes Conditional Introduction is also called Conditional Proof. Is that a rule you can use?04/18/19
Emma K.
We cannot use conditional proof.04/18/19
Emma K.
Also, where does conjunction and disjunction elimination come from?04/18/19
Hien B.
Really? I don't think this proof could be solved without using conditional proof or maybe reductio ad absurdum04/18/19
Hien B.
Oh sorry, that was a mistake. It should be disjunction introduction instead of elimination. Conjunction elimination is the same as Simplification04/18/19
Emma K.
Could you solve the proof again using the rules that I listed, so that it is easier for me to read and understand?04/18/19
Hien B.
With or without conditional proof?04/18/19
Emma K.
Without04/18/19
Emma K.
Where do the conditional and disjunction introductions come from? What rules are those?04/18/19