p > q
~q
Therefore, ~p
| p | q | p > q | ~q | ~p |
| t | t | t | f | f |
| t | f | t | t | f |
| f | t | t | f | t |
| f | f | t | t | t |
a table like your dinner table where you tell only the truth
1 and 0 equal 0. "AND" behave like multiplication.
Making a truth table is actually very simple.For the statement P, it can either be true, or false.P--TFNOT P, or -p (or ~p) is the opposite. If P is true, then not P is... false!The same holds true for if P is false, what is not P? True!The truth table for ~p looks like thisP | ~p--------T | FF | T
I don't really know what this is supposed to mean, if you want to print the truth-table of the NAND-gate that will be something like this: for (a=0; a<=1; ++a) for (b=0; b<=1; ++b) printf ("%d %d %d\n", a, b, !(a&&b))
truth i guess....
Richard M. Nixon
In maths a table is like a graph
like a table
it is a table with 8 sides like a HEXAGON.
Like table with no chairs
F. Kimpton has written: 'He lies like truth' 'The 'lies like truth''
This is a logical fallacy. That's like asking "What is the smell of the color nine?" Your asking if a question is the truth, when the question is asking for a truth and makes no assertions about the truth.