Three basic logic gates are AND, OR, and NOT. They process binary inputs—values represented as 0 or 1—and produce an output according to a simple logical rule.
Logic gates are the building blocks of digital circuits, from small control systems to computer processors. Understanding these three gates makes it easier to see how circuits make decisions, how more complex gates are formed, and why a binary signal can represent more than just a number.
What a Logic Gate Does
A logic gate is a circuit that applies a Boolean operation to one or more inputs. Boolean logic uses two possible values, commonly written as 0 and 1. In a physical circuit, those values are represented by voltage ranges or other electrical signal states; they are not necessarily exact voltages that are identical in every device.
Each gate has a defined relationship between its inputs and output. That relationship can be shown as a truth table, a compact list of every possible input combination and the resulting output. A gate does not understand a question or make a judgment in the human sense. It follows its electrical and logical design.
The AND Gate
An AND gate produces 1 only when every input is 1. If even one input is 0, the output is 0. With two inputs, A and B, the operation is written as A AND B, or sometimes A · B.
- A = 0, B = 0: output 0
- A = 0, B = 1: output 0
- A = 1, B = 0: output 0
- A = 1, B = 1: output 1
Imagine a device that should run only when a safety cover is closed and a start signal is active. If the two conditions are represented as binary inputs, an AND gate gives an active output only when both are true. Real safety systems require careful engineering; the example simply illustrates the gate’s logical rule.
The OR Gate
An OR gate produces 1 when at least one input is 1. Its output is 0 only when all inputs are 0. For two inputs, the notation is A OR B, often written A + B in Boolean algebra. Here, the plus sign represents logical OR, not ordinary arithmetic addition.
- A = 0, B = 0: output 0
- A = 0, B = 1: output 1
- A = 1, B = 0: output 1
- A = 1, B = 1: output 1
For example, a simple alert might activate if either of two monitored conditions occurs. An OR gate captures that rule. In everyday speech, “or” can sometimes mean one option but not both; the standard logic-gate OR is inclusive, so it also returns 1 when both inputs are 1.
The NOT Gate
A NOT gate has one input and reverses it: an input of 0 gives an output of 1, and an input of 1 gives an output of 0. It is also called an inverter. Its operation can be written NOT A or ¬A, with the exact symbol depending on the notation used.
In a circuit diagram, a NOT gate is commonly drawn as a triangle with a small circle at its output. That circle, called an inversion bubble, signals that the output is complemented. Similar bubbles can appear on other gate symbols to show that an input or output is inverted.
Truth Tables at a Glance
A truth table is often the clearest way to compare gates. The table below uses the same two inputs for AND and OR, then shows NOT separately because it has one input.
| A | B | AND | OR |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 |
| Input A | NOT A |
|---|---|
| 0 | 1 |
| 1 | 0 |
For gates with more than two inputs, the same basic rules apply: an AND gate requires every input to be 1, while an OR gate requires at least one input to be 1. The number of inputs does not change the meaning of the operation.
How Gates Combine into Circuits
Gates become more useful when connected. The output of one gate can serve as the input to another, allowing a circuit to represent a longer rule. For instance, a circuit might first use an OR gate to combine two possible requests, then use an AND gate to require that a separate permission signal is also active.
NOT gates can change the meaning of a condition. If A represents “door open,” then NOT A represents “door not open” in the circuit’s binary model. That does not automatically tell us whether the door is safely closed; the physical sensor and its fault behavior matter too. Logical labels should match what the hardware actually detects.
Combinations of gates can perform arithmetic, compare values, store information, and control operations. A processor contains vast networks of digital circuits, but the familiar idea remains: signals flow through components whose outputs follow defined rules.
Other Common Logic Gates
AND, OR, and NOT are the basic examples, but digital electronics also uses gates that combine or modify those operations. NAND is the opposite of AND: it outputs 0 only when all inputs are 1. NOR is the opposite of OR: it outputs 1 only when all inputs are 0.
XOR, or exclusive OR, outputs 1 when its inputs differ and 0 when they match. XNOR does the reverse, outputting 1 when the inputs match. These gates are useful in circuits that compare bits or handle arithmetic. NAND and NOR are called universal gates because circuits implementing any Boolean function can be built from either type alone, given suitable connections.
Symbols, Notation, and Binary Values
Gate symbols and Boolean notation may look different across textbooks, regions, or diagram conventions, but the truth table defines the operation. AND is often represented by a dot, OR by a plus sign, and NOT by a bar, a leading word, or a negation mark. A small circle on a symbol usually indicates inversion.
Binary 0 and 1 are logical labels, not always literal absence and presence of electricity. A circuit interprets voltage ranges as low or high according to its design. This distinction matters when connecting real components: compatible voltage levels, power, and input requirements must be considered rather than assuming every device treats any low or high signal identically.
Common Misunderstandings
- “OR means exactly one.” Standard OR is inclusive: it returns 1 when one input or both inputs are 1. XOR is the operation that returns 1 when the inputs differ.
- “A logic 1 always means a particular voltage.” It means the circuit recognizes the signal as the high state. The relevant voltage range depends on the hardware.
- “A gate is a whole decision-making program.” A gate performs a small, specified operation. Larger behavior comes from connecting many gates or combining hardware with software.
- “NOT simply means the opposite in every real-world sense.” It inverts a binary signal. Whether that signal accurately represents a physical condition depends on sensors, wiring, and circuit design.
How to Read or Build a Simple Logic Rule
When working through a circuit problem, start with the conditions in plain language. Translate “both must be true” to AND, “either may be true” to inclusive OR, and “the condition must be false” to NOT. Then list the possible input combinations and calculate each intermediate output before finding the final output.
- Label each input with a clear meaning, such as A and B.
- Write the rule using gate names or Boolean notation.
- Make a truth table for every possible input combination.
- For a combined circuit, evaluate one gate at a time and carry each result forward.
This method helps catch errors such as treating OR as exclusive or forgetting that a NOT gate changes only the signal connected to it. For physical construction, follow the component documentation and circuit requirements; a correct truth table alone does not guarantee safe or reliable hardware.
Frequently Asked Questions
What are the three basic logic gates?
They are AND, OR, and NOT. AND requires all inputs to be 1, OR requires at least one input to be 1, and NOT reverses its single input.
What is the difference between OR and XOR?
OR is inclusive: it outputs 1 if either input or both inputs are 1. XOR outputs 1 only when the inputs are different.
Is a logic gate hardware or software?
A logic gate is a logical operation that can be implemented in electronic hardware. Software can also model or simulate the same operation, but a software expression is not itself a physical gate.
Why are logic gates important in computers?
They process binary signals and can be combined into circuits that perform operations such as arithmetic, comparison, and control. More complex computing functions are built from networks of such operations.
Are NAND and NOR basic logic gates?
They are common logic gates, formed by inverting the outputs of AND and OR respectively. AND, OR, and NOT are often introduced first because they provide a straightforward foundation for understanding the others.
In Summary
AND, OR, and NOT are three foundational logic gates: AND outputs 1 only when all inputs are 1, OR outputs 1 when at least one input is 1, and NOT flips its input. Truth tables make their behavior precise, while combinations of gates explain how digital circuits carry out more complex tasks.