Conditioned Disjunction¶
A ternary Boolean connective whose middle argument selects the first branch when true and the third branch when false: [p,q,r] = (q ∧ p) ∨ (¬q ∧ r).
Core Idea¶
Conditioned disjunction is a ternary truth-functional connective introduced by Alonzo Church. In Church's argument order, [p,q,r] takes q as the condition, p as the true branch, and r as the false branch:
[p,q,r] \equiv (q\to p)\land(\neg q\to r) \equiv (q\land p)\lor(\neg q\land r).
When q is true, the connective has the value of p; when q is false, it has the value of r. It is therefore the Boolean “if q, then p, else r” operation. The name emphasizes a disjunction whose alternatives are gated by complementary conditions rather than an ordinary inclusive disjunction between peers.
Scope of Application¶
In propositional logic, conditioned disjunction supplies a compact primitive for case splits and permits alternate axiom systems for classical propositional calculus. Church's treatment shows how familiar connectives can be defined through the ternary operator and constants, allowing metatheoretic questions about sufficiency, independence, and proof systems.
In Boolean algebra, the connective is an if–then–else operator. It supports decomposition of Boolean functions by a chosen variable: split the function into the case where q=1 and the case where q=0, then reassemble the cofactors with conditioned disjunction. This is closely related to Shannon expansion and underlies decision diagrams and logic synthesis.
Clarity¶
A conditioned-disjunction statement should answer:
- What notation and argument order are used? 2. Which argument is the selector? 3. Which branch is chosen when the selector is true? 4. Is the logic classical and two-valued? 5. Are
pandrpropositions, Boolean values, or terms of a wider type? 6. Is the claim extensional—about the returned truth value—or operational—about evaluation? 7.
Manages Complexity¶
The connective compresses a two-case proof or definition into one compositional object. Instead of repeating “if q then use p; otherwise use r,” an analyst carries one term with explicit selector and branches. Nested terms build decision trees while retaining the conditional structure.
In Boolean-function manipulation, conditioned disjunction separates the choice of decomposition variable from the two cofactors.
Abstract Reasoning¶
The equivalence follows by cases. If q=1, then q\to p has value p and \neg q\to r is true, so their conjunction is p. If q=0, the first implication is true and the second has value r, so the conjunction is r. Rewriting implications gives (q\land p)\lor(\neg q\land r).
Knowledge Transfer¶
The mechanism transfers exactly among classical propositional logic, Boolean algebra, ideal switching circuits, SAT/SMT representations, binary decision diagrams, and pure Boolean conditional expressions. The roles map without metaphor: selector, true branch, false branch, and one output.
The transfer to general programming is partial. A language-level conditional may return arbitrary typed values and choose only one branch for evaluation. That operational laziness can prevent an exception or side effect in the unselected branch, whereas the truth function merely specifies the result under a valuation.
Relationships to Other Abstractions¶
Current abstraction Conditioned Disjunction Domain-specific
Parents (1) — more general patterns this builds on
-
Conditioned Disjunction is a kind of Selection Prime
Selection is the minimal prospective parent.
Hierarchy path (1) — routes to 1 parentless root
- Conditioned Disjunction → Selection
Neighborhood in Abstraction Space¶
Conditioned Disjunction sits in a sparse region of the domain-specific corpus (76th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Hoare Logic — 0.85
- Closed Preordered Set — 0.83
- q-Analog — 0.83
- Finite-Valued Logic — 0.83
- Superpartient Ratio — 0.83
Computed from structural-signature embeddings · 2026-09-08