document.write( "Question 975438: I'm having real difficulty solving this, can you please help?\r
\n" ); document.write( "\n" ); document.write( "INSTRUCTIONS: Use indirect truth tables to answer the following problems.\r
\n" ); document.write( "\n" ); document.write( "Given the argument:
\n" ); document.write( "Premises: E ⊃ J / B ⊃ Q / D ⊃ (J • ∼Q) Conclusion: (E • B) ≡ D\r
\n" ); document.write( "\n" ); document.write( "This argument is:
\n" ); document.write( "
\n" ); document.write( "Uncogent.
\n" ); document.write( "
\n" ); document.write( "Sound.
\n" ); document.write( "
\n" ); document.write( "Valid.
\n" ); document.write( "
\n" ); document.write( "Invalid.
\n" ); document.write( "
\n" ); document.write( "Cogent.
\n" ); document.write( "

Algebra.Com's Answer #597219 by jim_thompson5910(35256)\"\" \"About 
You can put this solution on YOUR website!
Symbols Note:
\n" ); document.write( "* I'm going to use \"->\" in place of the horseshoe
\n" ); document.write( "* I'm going to use & in place of the dot
\n" ); document.write( "* I'm going to use = in place of the triple equals sign\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "--------------------------------------------------------------------------------------\r
\n" ); document.write( "\n" ); document.write( "First assume that the argument is invalid. Recall that an argument is invalid if all premises are true with a false conclusion\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "So in this form\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\n" ); document.write( "\n" ); document.write( "
premise1/premise2/premise3//conclusion
TTTF
\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "So for this particular argument, I'm going to place F under the outermost connector \"=\" in the conclusion. Also I'm going to place T's under the outermost connectors of each premise (see below)\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\n" ); document.write( "\n" ); document.write( "
E->J/B->Q/D->(J&~Q)//(E&B)=D
TTTF
\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Note: The table form is a bit ugly, but it's the only way I could separate each term enough (to give the proper amount of alignment and spacing). \r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Then we try to find the truth values of all the symbols to force it to be invalid\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Now let's assume D is false. If that's the case, then (E&B) would have to be true. Place a T under the & in the conclusion. That forces E and B to both be true. So I'm going to place T's under the E and B in the conclusion\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\n" ); document.write( "\n" ); document.write( "
E->J/B->Q/D->(J&~Q)//(E&B)=D
TTTTTTTTFF
\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "If E is true, then J has to be true for E -> J to be true. Place a T under the J in premise1
\n" ); document.write( "If B is true, then Q has to be true for B -> Q to be true. Place a T under the Q in premise2
\n" ); document.write( "Place T's under the J and Q in premise3
\n" ); document.write( "Q is true, so ~Q is false. Place a F under the ~ next to the Q in premise3
\n" ); document.write( "overall, J&~Q is false, so place a F under the & in premise3
\n" ); document.write( "premise3 is forced to be true, (J&~Q) is false, so D must also be false (leading us back full circle to the initial assumption)\r
\n" ); document.write( "\n" ); document.write( "So here is what the full updated indirect truth table looks like\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\n" ); document.write( "\n" ); document.write( "
E->J/B->Q/D->(J&~Q)//(E&B)=D
TTTTTTFTTFFTTTTFF
\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "You'll notice that there are no contradictions. So assuming D is false leads to no contradictions.
\n" ); document.write( "Let's assume D is true
\n" ); document.write( "Following the same sort of logic, we will have this updated table (the second row of Ts and Fs corresponds to when D is true). I'm skipping showing the detailed step by step picture to save time/space. Hopefully my steps above will be enough to help you see how I'm getting this new row\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\n" ); document.write( "\n" ); document.write( "
E->J/B->Q/D->(J&~Q)//(E&B)=D
TTTTTTFTTFFTTTTFF
T or FTTFTFTTTTTFT or FFFFT
\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Note: The E in premise1 and E in the conclusion could either be True or False. You'll find it doesn't matter. So that's why I put \"T or F\" under those \"E\"s\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Again I couldn't find any contradictions for either row. Since there are no contradictions, this means that the claim \"the argument is invalid\" initially made goes unchallenged. The claim is true.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "So the argument is indeed invalid. Those two rows prove that there is a way to set up the truth values to where the premises are all true which lead to a false conclusion.
\n" ); document.write( "
\n" ); document.write( "
\n" );