ThmDex – An index of mathematical definitions, results, and conjectures.
Set of symbols
Alphabet
Deduction system
Theory
Zermelo-Fraenkel set theory
Set
Binary cartesian set product
Binary relation
Map
Function
Real collection function
Euclidean real function
Real function
Rational function
Integer function
Natural number function
Boolean function
Definition D5402
Boolean logic gate
Formulation 0
Let $\mathbb{B} = \{ 0, 1 \}$ be the D217: Set of boolean numbers.
A D18: Map $f : X \to Y$ is a boolean logic gate if and only if
(1) \begin{equation} \exists \, N \in 1, 2, 3, \ldots : X = \mathbb{B}^N \end{equation}
(2) \begin{equation} Y = \mathbb{B} \end{equation}
Formulation 1
A D18: Map $f : X \to Y$ is a boolean logic gate if and only if
(1) \begin{equation} \exists \, N \in 1, 2, 3, \ldots : X = \{ 0, 1 \}^N \end{equation}
(2) \begin{equation} Y = \{ 0, 1 \} \end{equation}
Children
AND boolean logic gate
Conditional basic boolean logic gate
Falsum basic boolean logic gate
NAND boolean logic gate
NOR boolean logic gate
NOT boolean logic gate
OR boolean logic gate
Verum basic boolean logic gate
XNOR boolean logic gate
XOR boolean logic gate