Comparable calculations are used for other logical functions such as negation, exclusive disjunction, etc. Exclusive disjunction is often used for bitwise operations. An operand of a disjunction is called a disjunct. Operators corresponding to logical disjunction exist in most programming languages. This follows from analogous facts about logical disjunction. Existential quantification is the disjunction of many instances of an equation. The mathematical symbol for logical disjunction varies in the literature. The rule makes it possible to eliminate a disjunction from a logical proof. A single literal is often considered to be a degenerate disjunction. Joined points represent an "or" condition, also known as a logical disjunction. Bertrand Russell would shortly afterward introduce logical disjunction (OR) in 1906. Meaning categories relate judgments; they include forms of conjunction, disjunction, forms of plural, among others. Also, sudden cardiac death could be the consequence of electric-mechanical disjunction and bradyarrhythmias. This can be used in proving disjunction and existence properties. Jevons argued for the result "x", which is correct for + as disjunction.