The following is a truth table for two boolean arguments. Any larger truth tables would be quite
difficult to node
A B |1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
_____|_____________________________________________________
T T |T T T T T T T T F F F F F F F F
T F |T T T T F F F F T T T T F F F F
F T |T T F F T T F F T T F F T T F F
F F |T F T F T F T F T F T F T F T F
legend:
1. true
2. or ( V )
3. consequence ( <= )
5. implication ( => )
7. equality ( = )
8. and ( ^ )
9. nand ¬(A ^ B)
10. not equal ( != ; or a = with a slash through it)
15. nor ¬(A V B)
16. false
¬ - not. Prefixed to nand and nor. I.E. True nand False is written as ¬(True ^ False)
If you have a boolean equation of True OR False, you can use the table find that the equation equals True. For larger equations, such as (True ^ ¬(False OR False)), resolve what's in the innermost parentheses first (in this case, False nor False is True), then work outwards. This example resolves to (True ^ True) or True.