Disjunction Elimination - Natural & Formal Sciences - Mathematics & Logic Dictionary Definition An inference rule (proof by cases) that allows deriving C from A ∨ B together with a derivation of C under the assumption A and a derivation of C under the assumption B. Formally: from A ∨ B, [A ⇒ C], [B ⇒ C] infer C.
Disjunction Elimination - Natural & Formal Sciences - Mathematics & Logic Dictionary Definition An inference rule (proof by cases) that allows deriving C from A ∨ B together with a derivation of C under the assumption A and a derivation of C under the assumption B. Formally: from A ∨ B, [A ⇒ C], [B ⇒ C] infer C.