Rel, bicategory of relations, allegory
left and right euclidean;
extensional, well-founded relations.
constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
A relation in which either it or its negation is true.
A decidable binary relation $R$ on a set $S$ is a relation such that for all elements $a \in S$ and $b \in S$, $R(a, b)$ or $\neg R(a, b)$.
Every set with decidable equality has a decidable equality relation.
In the presence of excluded middle, every relation is a decidable relation.
Last revised on January 18, 2024 at 15:07:39. See the history of this page for a list of all contributions to it.