For other notions of mutually exclusive, see mutual exclusivity.
constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
basic constructions:
strong axioms
further
Two propositions and are said to be mutually exclusive if holds.
By currying, both and hold. As a result, in the antithesis interpretation of intuitionistic logic, is a negation of and is a negation of . In addition, is affirmative and is refutative if the implication is a logical equivalence ; i.e. is the Heyting negation of . Conversely, is refutative and is affirmative if the implication is a logical equivalence ; i.e. is the Heyting negation of . and are both stable if they are both affirmative and refutative. and are decidable if holds.
In dependent type theory under the propositions as types interpretation, two types and are mutually exclusive if there is an element of the function type from the product type to the empty type .
Last revised on January 17, 2025 at 17:45:50. See the history of this page for a list of all contributions to it.