document.write( "Question 809634: Give a truth table that shows the Boolean value of each of the following Boolean expressions, for every possible combination of input values. Hint: including columns for intermediate expressions is helpful. I have no idea where to start. Could you please help me understand how to make truth tables of them?
\n" );
document.write( "a) not (p and q)
\n" );
document.write( "b) (not P) and Q
\n" );
document.write( "c) (not P) or (not(q)
\n" );
document.write( "d) (P and Q) or R
\n" );
document.write( "e) (P or R) and (Q or R)
\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #489016 by Edwin McCravy(20055)![]() ![]() You can put this solution on YOUR website! \r\n" ); document.write( "I'll do a), c), and e).\r\n" ); document.write( "\r\n" ); document.write( "To construct a truth table:\r\n" ); document.write( "\r\n" ); document.write( "Begin every truth table that has two letters like this\r\n" ); document.write( "\r\n" ); document.write( "p | q |\r\n" ); document.write( "-------\r\n" ); document.write( "T | T |\r\n" ); document.write( "T | F |\r\n" ); document.write( "F | T |\r\n" ); document.write( "F | F |\r\n" ); document.write( "\r\n" ); document.write( "Begin every truth table that has three letters like this:\r\n" ); document.write( "\r\n" ); document.write( "p | q | r |\r\n" ); document.write( "-----------\r\n" ); document.write( "T | T | T |\r\n" ); document.write( "T } T | F |\r\n" ); document.write( "T | F | T |\r\n" ); document.write( "T | F | F |\r\n" ); document.write( "F | T | T |\r\n" ); document.write( "F | T | F |\r\n" ); document.write( "F | F | T |\r\n" ); document.write( "F | F | F |\r\n" ); document.write( "\r\n" ); document.write( "Rule for \"not\": \r\n" ); document.write( "1. If \"not\" precedes T, it becomes F\r\n" ); document.write( "2. If \"not\" precedes F, it becomes T\r\n" ); document.write( "\r\n" ); document.write( "Rule for \"or:\r\n" ); document.write( "\"or\" is T except when there are F's on both sides of \"or\". Then it's F.\r\n" ); document.write( "\r\n" ); document.write( "Rule for \"and\":\r\n" ); document.write( "\"and\" is F except when there is T's on both sides of \"and\". Then it's T.\r\n" ); document.write( "\r\n" ); document.write( "a) not (p and q)\r\n" ); document.write( "\r\n" ); document.write( "p | q | p and q | not(p and q) |\r\n" ); document.write( "--------------------------------\r\n" ); document.write( "T | T | T | F | \r\n" ); document.write( "T | F | F | T | \r\n" ); document.write( "F | T | F | T | \r\n" ); document.write( "F | F | F | T | \r\n" ); document.write( "\r\n" ); document.write( " c) (not P) or (not q)\r\n" ); document.write( "\r\n" ); document.write( "p | q | (not p) | (not q) | (not P) or (not q) |\r\n" ); document.write( "------------------------------------------------\r\n" ); document.write( "T | T | F | F | F | \r\n" ); document.write( "T | F | F | T | T |\r\n" ); document.write( "F | T | T | F | T |\r\n" ); document.write( "F | F | T T | T |\r\n" ); document.write( "\r\n" ); document.write( "e) (P or R) and (Q or R)\r\n" ); document.write( "\r\n" ); document.write( "P | Q | R | (P or R) | (Q or R) | (P or R) and (Q or R) |\r\n" ); document.write( "---------------------------------------------------------\r\n" ); document.write( "T | T | T | T | T | T |\r\n" ); document.write( "T } T | F | T | T | T |\r\n" ); document.write( "T | F | T | T | T | T |\r\n" ); document.write( "T | F | F | T | F | F |\r\n" ); document.write( "F | T | T | T | T | T | \r\n" ); document.write( "F | T | F | F | T | F | \r\n" ); document.write( "F | F | T | T | T | T |\r\n" ); document.write( "F | F | F | F | F | F |\r\n" ); document.write( "\r\n" ); document.write( "Edwin\n" ); document.write( " |