Boolean gates and truth tables
Logic gates compute Boolean functions with truth values 0 and 1.
Key knowledge
AND returns 1 exactly when both inputs are 1; inclusive OR returns 1 when at least one is 1; NOT exchanges 0 and 1. Two-input XOR returns 1 exactly when inputs differ. A truth table specifies every input combination; AND, OR and NOT suffice to express any finite-input Boolean function.
Conditions and scope
- Inputs and outputs are Boolean values; Boolean OR is not ordinary integer addition.
- This is a functional definition. A physical implementation also needs valid signal levels and timing specifications.
Boolean functional definitions; no transistor-count or timing-performance claim.
Sources · 1
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Checked the stated boolean gates and truth tables and restrictions against the listed primary sections; exact inspected boundaries are in the author receipt.
2026-10-10 · Independent Physics and Measurement reference editor (AI editorial bounded review). Independent AI editorial review of this entry's statements, equations, applicability conditions and source coverage. Source checks apply to these claims within their stated limits.
Entry details
Permanent link to this entry ↗- Record identity
- foundation-info-boolean-gates
- Revision
- foundations-refresh.1
- Structured reference record
- Foundational reference additions