A binary truth-functional connective (usually written ∨) that yields true exactly when at least one of its operand formulas is true; in classical logic this is the inclusive 'or'.

Principle

The truth of a disjunction is determined by the truth of its disjuncts: it is false only when every disjunct is false, and true otherwise; it is monotonic in each operand.

Demonstration

Let P be 'It is raining' and Q be 'It is windy'. P ∨ Q is true whenever P is true, Q is true, or both are true; the truth table rows where P=F and Q=F give P ∨ Q = F, all other rows give T.

Misapplication

Treating the connective as exclusive 'or' (XOR) in formal proofs or assuming P ∨ Q permits inference of which disjunct holds (affirming a disjunct) are common misuses.

Consequence

Disjunction permits reasoning about alternatives and case splits; from P one may validly infer P ∨ Q, and disjunction introduction and proof by cases are standard proof rules.

Reversal

Conjunction (P ∧ Q) requires both operands true; treating conjunction as if it were a disjunction inverts the requirement for truth and yields different entailments.

Boundary

This definition applies to classical, truth-functional settings; in many-valued logics or substructural logics the clause for ∨ can be different (e.g., max operator or resource-sensitive alternatives); natural-language 'or' may carry exclusive implicatures not captured here.

Semantic Tension

Tension exists between inclusive disjunction (truth-functional ∨) and exclusive or conversational readings or relevance-oriented alternatives; formal ∨ does not encode exclusivity, causation, or speaker intent.

Synthesis

Disjunction is the truth-functional operator that encodes logical alternation: it is true when at least one disjunct is true, enabling introduction of alternatives and case-based reasoning while remaining distinct from exclusive or pragmatic meanings.