Two-input gates

Given the amount of terminology and symbology being used, I thought it might be a good idea to summarize all the possible operations for a two-input gate. Of course these range from the trivial to the regular to the obscure, but we'll see...

CategoryTruthDescriptionSymbolGate
0 on00|0
01|0
10|0
11|0
Always low0
1 on00|1
01|0
10|0
11|0
NOR
∨̅
00|0
01|1
10|0
11|0
Abjunction
(NOT A AND B)
00|0
01|0
10|1
11|0
Abjunction
(A AND NOT B)
00|0
01|0
10|0
11|1
AND&
2 on00|1
01|1
10|0
11|0
NOT A
00|1
01|0
10|1
11|0
NOT B
00|1
01|0
10|0
11|1
Equivalence, XNORA = B
00|0
01|1
10|1
11|0
Exclusive OR, XOR
00|0
01|1
10|0
11|1
BB
00|0
01|0
10|1
11|1
AA
3 on00|1
01|1
10|1
11|0
NAND

∧̅
00|1
01|1
10|0
11|1
Material conditional
(negation of abjunction)
NOT A OR B
00|1
01|0
10|1
11|1
Material conditional
(negation of abjunction)
A OR NOT B
00|0
01|1
10|1
11|1
OR
|
4 on00|1
01|1
10|1
11|1
Always high1
English Help // Deutsche Anleitung // Deutsches Klassenzimmer // Two-input gates // Three-input gates // Alternatives // Development