I found or(x,y) = not(and(not(x),not(y))). I think that’s the law idk
truth table:
x | y | not(and(not(x),not(y))) |
---|---|---|
1 | 1 | 1 |
0 | 1 | 1 |
1 | 0 | 1 |
0 | 0 | 0 |
Law 2:
and(x,y) = not(or(not(x),not(y)))
I looked up what a law is and i think this definition applies:
Merriam Webster:
a general relation proved or assumed to hold between mathematical or logical expressions.
I think it’s that def cuz the equals sign says theres a relation between the two expressions.
Truth table:
x | y | not(or(not(x),not(y))) |
---|---|---|
1 | 1 | 1 |
0 | 1 | 0 |
1 | 0 | 0 |
0 | 0 | 0 |