Need help with a simple logic proof.

From: xaceri@xxxxxxxxxxx
Date: 7 Mar 2007 16:45:02 -0800

I've tried everything I can think of, I just can't get this conclusion
from these premises. Here's the problem:

1. L->M
2. N->O
C. (L v N)->(M v O)

I hope that makes sense, I'm not really sure how to write all the
symbols on the computeror if I need to replace the propositional
letters with something else. To solve this we're allowed to use modus
ponens, modus tollens, hypothetical syllogism, disjunctive syllogism,
constructive dilema, conjunction, simplification, addition,
transposition, material implication, material equivalence,
exportation, tautology, DeMorgan's theorem, computation, association,
distribution, and double negation.

Thanks for any help anyone can give me.

.

Follow-Ups:
- Re: Need help with a simple logic proof.
  - From: G . Frege

Prev by Date: Re: infinitely many nn's = infinite nn's?
Next by Date: Re: Help me understand this proof
Previous by thread: Help me understand this proof
Next by thread: Re: Need help with a simple logic proof.
Index(es):
- Date
- Thread

Relevant Pages

Re: Help with a problem
... >> hypothetical syllogism ... >> material implication ... >> material equivalence ... you guys that's sort of the equivalent to somebody asking me for more ...
(sci.logic)
Re: Help with a problem
... CP is a Copi rule: ... modus ponens ... hypothetical syllogism ... material implication ...
(sci.logic)
Re: Help with a problem
... > modus ponens ... > hypothetical syllogism ... > absorption ... > material implication ...
(sci.logic)