We need a lot more here--the above is just a rough first attempt.
Truth tables are also used in Finite Mathematics and its applications to describe the boolean? outputs of an expression, circuit, or other computational entity for each possible value of its inputs. The input variable?s and output expressions are listed as column headings. The rows of the table are filled by listing each possible combination of inputs, one combination per row, and filling in the outputs that result from each combination of inputs.
Example of a truth table in logic (T = true, F = false):
P | Q | P and Q | P or Q | Pxor?</pre> Q | P → Q
</pre>
T | T | T | T | T | T T | F | F | T | F | F F | T | F | T | F | T F | F | F | F | T | T
Example of a truth table in finite mathematics:
x | y | x and y | x or y | x xor y ------------------------------------------- 0 | 0 | 0 | 0 | 0 0 | 1 | 0 | 1 | 1 1 | 0 | 0 | 1 | 1 1 | 1 | 1 | 1 | 0