I've been looking at logic gates, boolean expressions and Karnaugh maps.
I ran into a question regarding whether it was possible to implement all logic functions using only one logic gate: an OR gate where the B input is inverted.
I've devised the truth table for this, as follows:
a b out
0 0 1
0 1 0
1 0 1
1 1 1
I've also created the Karnaugh map for it and the boolean expression.
I've also attempted to create a few logic functions using the gate.
Can anyone point me in the right direction as to what method is best for determining whether this specific gate (or any gate, for that matter) can implement all/any of the logic functions, either through the use of Karnaugh maps, truth tables or boolean expressions (or any other method that would help me solve this)?