question about discrete Mathematics

inverse

New member
Joined
May 17, 2012
Messages
16
Hi!


I have an argument and I have to prove the validity of all possible ways.


I have proved by logical implication, tautology, contradiction and contrapositive, but the problem is reduced to prove the hypothesis by logical equivalences and implications.


The reasoning is as follows:


[P->(L->M)]^L^M -> ¬P


I've tried to do the following:


[P-> (L-> M)] ^ L ^ M


<=> [(P ^ L) -> M] ^ L ^ M {Export}


<=> (¬ ¬ P v L v M) ^ L ^ M {Involvement and Morgan}




From here not continue, and I've tried other ways and always came to the same and not continue.


Could anyone help me out?


Thanks! ;)
 
Top