Skip to content

Logical or

The inclusive disjunction connective: classically false only when every disjunct is false, and otherwise governed by the declared logic’s semantic and proof rules.

Version
v1 · 2026-09-28 · History
Domain-specific #
10486
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Propositional Logic → Mathematics

Core Idea

Logical OR forms a proposition from alternatives. In classical logic its truth table is inclusive: either disjunct suffices, and both may hold. Algebraic properties such as commutativity, associativity, and idempotence follow under the classical interpretation.

The symbol alone does not exhaust the abstraction. Natural deduction gives introduction and case-elimination rules; intuitionistic and other nonclassical systems distinguish proof conditions; software may add short-circuit evaluation or lift OR bitwise. A precise use names the logical or operational system.

Structural Signature

Sig role-phrases:

  • Left disjunct — Supplies one proposition or formula to the connective. It is operand. Counterfactual: A mere list item without propositional role is not a disjunct.
  • Right disjunct — Supplies the alternative proposition or formula. It is operand. Counterfactual: Unary negation cannot substitute for the binary connective.
  • Semantic clause — Determines truth or satisfaction from the values or conditions of the disjuncts. It is semantics. Counterfactual: Exclusive interpretation changes the both-true case.
  • Introduction rule — Allows A∨B to follow from either established disjunct. It is inference. Counterfactual: A syntactic symbol without rules does not fix proof behavior.
  • Elimination rule — Permits case reasoning from the disjunction when both branches support a common conclusion. It is inference. Counterfactual: Choosing one branch without support is invalid.
  • Evaluation discipline — Controls order, short-circuiting, or bitwise lifting in computational settings. It is implementation. Counterfactual: Operational evaluation must not be mistaken for the abstract classical truth function.

What It Is Not

  • It is not exclusive OR unless the both-true case is explicitly excluded.
  • It is not a linguistic disjunct adjunct.
  • It is not automatically identical to natural-language or in every context.
  • It is not bitwise union of data absent a Boolean interpretation.
  • Closest near-miss. Exclusive OR rejects the both-true case; inclusive logical OR accepts it. Natural language often leaves exclusivity to context rather than lexical meaning alone.

Scope of Application

  • Formal proofs. Expresses alternatives and supports reasoning by cases.
  • Boolean algebra. Provides join under the usual false–true ordering.
  • Digital logic. Implements a gate high when one or more inputs are high.
  • Programming. Combines predicates and may control evaluation through short-circuiting.
  • Databases and search. Broadens selection to records satisfying at least one condition.

Clarity

State the formal system, syntax, arity, truth or satisfaction clause, proof rules, and any evaluation-order behavior. Test the both-false and both-true cases explicitly, because these distinguish disjunction from tautology and exclusive alternatives.

Manages Complexity

The connective compresses branching alternatives into one formula while retaining a disciplined route for later case analysis. Separating semantic truth, inferential warrant, and execution behavior prevents invalid transport between proofs, circuits, queries, and effectful programs.

Abstract Reasoning

  1. Type each operand as a proposition, formula, predicate, or Boolean-valued computation.
  2. Declare inclusive, exclusive, or nonclassical semantics.
  3. Evaluate the defining cases, especially both false and both true.
  4. Apply introduction only from an established disjunct.
  5. Use elimination by deriving the same conclusion from every admissible branch.
  6. Track order and side effects separately in computational implementations.

Knowledge Transfer

The transferable cargo is alternative aggregation plus case-sensitive elimination. It transfers across proof systems, circuits, and software only when operand type and semantic rules are mapped; it stops at the English word or where pragmatic force remains unspecified.

Examples

Applied / In Practice

For propositions A and B, A∨B has values false, true, true, true over inputs FF, FT, TF, TT respectively.

Mapped back: FF → false; FT → true; TF → true; TT → true.

Applied / In Practice

From A one may infer A∨B; from A∨B together with derivations of C from A and of C from B, one may infer C by cases.

Mapped back: introduction → one branch; elimination → both branches to C.

Applied / In Practice

A programming expression returns the first truthy operand and skips evaluation of the second; it implements OR-like control flow but its returned value and side effects exceed a pure proposition-level truth function.

Mapped back: short circuit → yes; pure truth value → not necessarily.

Structural Tensions

T1 — Inclusive Semantics versus Exclusive Conversational Inference. Formal OR permits both disjuncts while speakers sometimes imply exactly one.

Diagnostic: Is exclusivity encoded, conventionally implicated, or merely expected?

T2 — Truth-Functional Value versus Proof-Theoretic Meaning. A table classifies valuations while inference rules govern justified use in derivations.

Diagnostic: Does the target logic validate the classical correspondence?

T3 — Abstract Commutativity versus Evaluation Order. A∨B and B∨A share classical truth values, yet short-circuit programs may differ in effects.

Diagnostic: Are operands pure propositions or computations?

Structural–Framed Character

Logical OR is hybrid: structurally an alternative-forming connective and framed by the semantics, proof calculus, or execution model in which it is interpreted.

Structural Core vs. Domain Accent

The core is a binary or iterated join of alternatives. Logic supplies propositions, valuation, satisfaction, introduction, elimination, classical and intuitionistic distinctions; computing supplies Boolean values, gates, bit lifting, and short-circuit order.

This entry is a kind of Logical Operation.

  • Approved root. The frozen graph does not identify the broader abstraction that preserves both the connective’s semantic and inferential identity.

  • Related — disjunction, Boolean algebra, logical AND, exclusive OR, De Morgan law, and proof by cases. These provide its conventional name, algebra, dual, contrast, and inferential use.

Relationships to Other Abstractions

Local relationship map for Logical orParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Logical orDOMAINDomain-specific abstraction: Logical Operation — is a kind ofLogicalOperationDOMAIN

Current abstraction Logical or Domain-specific

Parents (1) — more general patterns this builds on

  • Logical or is a kind of Logical Operation Domain-specific

    Logical or satisfies the defining boundary of Logical Operation: A logical operation is a rule-governed transformation or interpretation that maps typed truth values, propositions, formulas, terms, or formally specified program values to an output according to declared semantic or inferential rules.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Logical or sits in a crowded region of the domain-specific corpus (32nd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Logical Connectives & Formal Systems (13 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With

  • Exclusive OR. Tell: XOR is false when both inputs are true; inclusive OR is true in that case.
  • Linguistic Disjunct. Tell: A linguistic disjunct comments on a clause and is unrelated to joining propositions as alternatives.
  • Set Union. Tell: Union is an analogous join on sets, not itself a propositional connective.
  • Bitwise OR. Tell: Bitwise OR applies the Boolean operation coordinatewise to bit patterns and can have nonlogical data semantics.

References

  • Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Logical_disjunction (revision 1369489365).
  • Preserved source candidate: https://plato.stanford.edu/archives/win2016/entries/disjunction/
  • Preserved source candidate: https://www.britannica.com/topic/disjunction-logic
  • Preserved source candidate: https://mathworld.wolfram.com/OR.html
  • Preserved source candidate: https://www.worldscientific.com/doi/abs/10.1142/9783
  • Preserved source candidate: https://docs.python.org/3/reference/expressions.html#boolean-operations
  • Preserved source candidate: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Logical_AND
  • Preserved source candidate: https://www.its.caltech.edu/~matilde/IntuitionismPropositionalCalc.pdf
  • Preserved source candidate: https://mathworld.wolfram.com/Disjunction.html

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.