document.write( "Question 1194343: Math\r
\n" ); document.write( "\n" ); document.write( "Construct a truth table for the following. Hint: you will need to use each of the columns!\r
\n" ); document.write( "\n" ); document.write( "((p V q) ∧ ~ q) → p\r
\n" ); document.write( "\n" ); document.write( " p q \n" ); document.write( "
Algebra.Com's Answer #826533 by Edwin McCravy(20056)\"\" \"About 
You can put this solution on YOUR website!
\r\n" );
document.write( "((p V q) ∧ ~ q) → p\r\n" );
document.write( "\r\n" );
document.write( "~ is negation, ~T gets an F and ~F gets a T\r\n" );
document.write( "V is disjunction. F V F gets an F, everything else gets a T.\r\n" );
document.write( "∧ is conjunction. T ∧ T gets a T, everything else gets an F.\r\n" );
document.write( "→ is conditional. T → F gets an F, everything else gets a T. \r\n" );
document.write( "\r\n" );
document.write( "((p V q) ∧ ~ q) → p\r\n" );
document.write( "\r\n" );
document.write( " p | q | p V q | ~q | (p V q) ∧ ~ q || ((p V q) ∧ ~ q) → p |\r\n" );
document.write( " T | T |   T   |  F |         F     ||                 T   |\r\n" );
document.write( " T | F |   T   |  T |         T     ||                 T   |\r\n" );
document.write( " F | T |   T   |  F |         F     ||                 T   |\r\n" );
document.write( " F | F |   F   |  T |         F     ||                 T   |\r\n" );
document.write( "\r\n" );
document.write( "Since it came out TTTT, all T's it is a tautology, always true.\r\n" );
document.write( " \r\n" );
document.write( "Edwin
\n" ); document.write( "
\n" );