document.write( "Question 1150092: 1. [A v (K & J)] > (~E &~F)
\n" );
document.write( "2. M > [A & (P v R)]
\n" );
document.write( "3. M & U /~E & A
\n" );
document.write( "How do I continue? \n" );
document.write( "
Algebra.Com's Answer #771451 by jim_thompson5910(35256)![]() ![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "The conclusion has ~E and A. So we'll have to track down those terms. \r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "We see \"A\" is buried in the second premise. To free it, we need to use modus ponens. So we'll need the antecedent M. Luckily line 3 has an M we need. Use the simplification rule to go from M&U to just M. We will never use the \"U\" that is part of line 3. This is likely a distraction your teacher has thrown in.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Once we have M, we can use modus ponens along with line 2 to get A & (P v R). Use simplification to reduce that to just A. The (P v R) is never used. Probably another distraction.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "With \"A\" freed up, we can use the addition rule to add on any logical expression we want. Go from A to A v (K & J). This builds up the antecedent of premise 1, which helps free up ~E & ~F\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Now use simplification yet again to get ~E.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Together with ~E and A, we'll use the conjunction rule to get the conclusion we are aiming for.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "--------------------------------------------------- \n" ); document.write( "Here's what the full derivation looks like \n" ); document.write( "
\n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Abbreviations Used: \n" ); document.write( "Add = Addition \n" ); document.write( "Conj = Conjunction \n" ); document.write( "MP = Modus Ponens \n" ); document.write( "Simp = Simplification\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "The rules of addition, conjunction, modus ponens and simplification are part of a group of logic rules of inference. \n" ); document.write( "For more information, check out the link below \n" ); document.write( "https://www2.cs.duke.edu/courses/summer13/compsci230/restricted/lectures/L05.pdf \n" ); document.write( "(the specific rules are found on pages 5, 9, 10, and 11) \n" ); document.write( " \n" ); document.write( " |