I found something recently that I thought was pretty neat.

Let “true” be represented by a 1 and “false” be represented by a 0.  Consider two logical claims A and B.  The Truth tables for “A and B” and “A or B” are as follows:

But what if we represent “true” by 0 and “false” by a 1.  Then we get the following truth tables.

Now look!  The Blue Truth Table for “and” is the same as the black truth table for “or”.  And the blue truth table for “or” is the same as the black truth table for “and”.

This is a visual depiction of DeMorgan’s laws.  They state (as this shows) that if you “not” everything, then “and” becomes “or” and “or” becomes “and”.  And I think that’s kinda neat.