Formula & Calculator
Boolean OR Operation
The logical OR function outputs true when at least one input is true.
Interpretation
Boolean OR operation: output Y is 1 if at least one input is 1; it is 0 only when all inputs are 0.
It is equivalent to logical addition.
Example: A=0, B=1 → Y = 0+1 = 1; A=0, B=0 → Y = 0.
Variables
| Symbol | Quantity | Unit |
|---|---|---|
| Y | Output | dimensionless |
| A | Input A | dimensionless |
| B | Input B | dimensionless |
What it means
The Boolean OR operation outputs a 1 when at least one input is 1. It is equivalent to logical addition. For two inputs A and B, Y = A + B. The truth table shows Y=0 only when both A and B are 0. The OR gate is used in digital circuits to combine signals, for example, in priority encoders and interrupt systems. In programming, the logical OR is represented by ||. The OR operation is associative and commutative. Example: A=0, B=1 → Y = 0+1 = 1. A=0, B=0 → Y = 0. This is used to generate active‑high enable signals and to implement logic functions in programmable logic devices.
Worked example
Boolean OR – Practical Example
Real‑World| Parameter | Value |
|---|---|
| Temp (A) | 0 (normal) |
| Pressure (B) | 1 (low) |
| Formula | Y = A + B |
Common mistakes
Watch unit consistency and the assumptions behind the formula; misapplying it outside its valid conditions is the most frequent error.Applications
Boolean OR operation Y = A + B yields 1 when at least one input is 1. This is another basic logic gate, used in digital circuits for logical disjunction. Engineers use it in priority encoders, combinational logic, and bus systems. Like AND, the OR gate is a fundamental building block of digital electronics. By combining OR and AND with NOT gates, any logic function can be implemented. Understanding the OR operation is crucial for digital design and Boolean algebra. This operation is used in all digital systems, from simple circuits to complex processors.
- Digital logic design and circuit synthesis
- Encoder, priority encoder, and comparator design
- Boolean algebra and combinational logic
- Bus and data routing circuits
- Educational foundation of digital electronics
Frequently Asked Questions
The OR operation outputs true (1) when at least one input is true. The expression is Y = A + B (or A | B). It is the logical disjunction.
For two inputs: A=0,B=0→0; 0,1→1; 1,0→1; 1,1→1.
Using an OR gate (e.g., 74LS32). It can also be implemented using NOR gates.
Commutative: A+B = B+A; Associative: (A+B)+C = A+(B+C); Identity: A+0 = A; Annihilator: A+1 = 1; Idempotent: A+A = A.
The dual is the AND operation. De Morgan's theorem: (A+B)' = A'·B'.
Used in address decoding, priority encoders, and combining conditions.
Common errors: 1) confusing with AND, 2) forgetting the identity rules, 3) using it for arithmetic (use addition for numbers), 4) applying to non-binary values.
Logical OR operates on Boolean values; bitwise OR operates on each bit (e.g., 1010 | 1100 = 1110).