Should also mention how you can build the other logical operations with only negation and conjunction. For example, the operator "or" can be defined : A or B = not( not A and not B ). Another example is the XOR operator, which can be built with "and" and "or" : A xor B = ( A or B ) and not ( A and B ).
Question: @1:40 we see a circuit that is used as an analogy to the truth table on the right. The circuit is supposed to represent A or B, just like the truth table shown. Only problem is that in the circuit, it can ONLY be A or B, but it can't be both. This is in contrast to the truth table where A and B can be true so it isn't an exact analogy. Did I get this right or did I miss something?
The analogy is true 100% it's not "it can only be A or B" it's if one of A or B is true it's enough if A and B were true then the fact that B is true with A is not important what is important is that at least one of them is true, it's not the best example but it's good enough.