document.write( "Question 1191576: please help me solve this: Construct a proof of the following argument: (L&M) ∨ ¬L, ¬(L&M) →
\n" );
document.write( "¬M ∴ L ↔ M. \n" );
document.write( "
Algebra.Com's Answer #823889 by math_tutor2020(3816)![]() ![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "I'm not sure how math_helper got that derivation. \n" ); document.write( "Unfortunately it's not correct because for instance Modus Tollens needs two components to it. \n" ); document.write( "Modus Tollens is of the form \n" ); document.write( "P -> Q \n" ); document.write( "~Q \n" ); document.write( "Therefore ~P \n" ); document.write( "However, math_helper only mentioned one line. \n" ); document.write( "We would need the premise M to be able to get ~~(L & M) = L & M \r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Also, there's a mistake in going from something like L -> (L & M) to L -> M using the simplification rule. \n" ); document.write( "It's not valid because the simplification rule must be applied to entire arguments only and not pieces of such. Unfortunately we can't go from L & M to L even though it's tempting to do so.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Here's how I would do the derivation \n" ); document.write( "
\n" ); document.write( "Other derivations may be possible (and are probably likely). \n" ); document.write( " \n" ); document.write( " |