PCB TOOLS / Electronics reference
Logic-Gate Truth Tables and Boolean Algebra
Look up seven basic0/1 truth tables and Boolean operations. Preserve the original merged input cells and add explicit headings, with readable De Morgan, distributive and absorption identities. Logic1 is not universally5 V.
Quick answer
Two-input AND is1 only for11; OR is0 only for00. XOR is1 for unequal inputs, XNOR for equal inputs. NAND/NOR negate AND/OR; NOT complements one input. Here+ means OR and a dot means AND, not ordinary integer arithmetic.
Scope
These verified tables describe stable two-valued positive logic, not thresholds, delay, hazards, tri-state or open-collector behavior. XOR here has two inputs; odd-parity and exactly-one extensions differ for more inputs. Legacy TeX notes remain archived; the supplemental plain-text identities are readable independently.
Reading example
ForA=B=1, AND=1, OR=1, XOR=0 and XNOR=1. Negating OR gives NOR=0; De Morgan’sNOT(A OR B)=NOT A AND NOT B gives the same result.
Checked reference tables
| Identity | Equation |
|---|---|
| De Morgan1 | NOT(A OR B) = (NOT A) AND (NOT B) |
| De Morgan2 | NOT(A AND B) = (NOT A) OR (NOT B) |
| Absorption | A OR (A AND B) = A |
| Distribution | A AND (B OR C) = (A AND B) OR (A AND C) |
Legacy tables with visible corrections







| Input A (source includes label rows) | Input B | Output Y |
|---|---|---|
| Input | Output | |
| A | B | A and B |
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
| Input A (source includes label rows) | Input B | Output Y |
|---|---|---|
| Input | Output | |
| A | B | A or B |
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
| Input A (source includes label rows) | Output Y |
|---|---|
| Input | Output |
| A | not A |
| 0 | 1 |
| 1 | 0 |
| Input A (source includes label rows) | Input B | Output Y |
|---|---|---|
| Input | Output | |
| A | B | A nand B |
| 0 | 0 | 1 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
| Input A (source includes label rows) | Input B | Output Y |
|---|---|---|
| Input | Output | |
| A | B | A nor B |
| 0 | 0 | 1 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 0 |
| Input A (source includes label rows) | Input B | Output Y |
|---|---|---|
| Input | Output | |
| A | B | A xor B |
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
| Input A (source includes label rows) | Input B | Output Y |
|---|---|---|
| Input | Output | |
| A | B | A xnor B |
| 0 | 0 | 1 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
Legacy source notes and applicability
These notes retain the legacy record. For corrected facts and applicability, use this page’s quick answer, scope and visible table corrections.
AND $$A·B$$
OR $$A+B$$
NOT $$\ov A$$
NAND $$\ov{A·B}$$
NOR $$\ov{A+B}$$
XOR $$A⊕B$$
XNOR $$\ov{A⊕B}$$ $$A⊙B$$
Boolean Algebra Theorems
AND, OR are associative:
$$A·B·C=(A·B)·C=A·(B·C)$$ $$A+B+C=(A+B)+C=A+(B+C)$$
AND and OR are commutative:
$$A·B=B·A$$ $$A+B=B+A$$
Distributive property:
$$A+B·C=(A+B)·(A+C)$$ $$A·(B+C)=A·B+A·C$$
DeMorgan's Theorems:
$$\ov{A+B}=\ov{A}·\ov{B}$$
$$\ov{A·B}=\ov{A}+\ov{B}$$
Single Variable Theorems:
$$A·A=A,\; A+A=A$$ $$A+\ov{A}=1,\; A·\ov{A}=0,\; A=\ov{(\ov{A})}$$
More two-variables Theorems:
$$A+A·B=A$$ $$A+\ov{A}·B=A+B$$
Identity and Null operations:
$$A·1=A,\; A+1=1$$ $$A+0=A,\; A·0=0$$ $$\ov1=0,\; \ov0=1$$
Frequently asked questions
Why isA+A equal toA, not2A?
Boolean+ means OR, so1 OR1 remains1; it is not ordinary addition.
Can NAND implement other gates?
Yes. Joining both NAND inputs toA givesNOT A, subject to real fan-out, threshold and timing limits.
Related tools and references
Sources and verification
Legacy baseline: the Electrodoc Pro 5.2 data package. Raw records are retained and checked factual corrections are shown explicitly.