Showing changes from revision #3 to #4:
Added | Removed | Changed
Given a decidable set , a function is a decidable strict order (also called decidable strict total order, decidable strict linear order, or decidable pseudo-order) if it comes with
an identity
representing the irreflexivity condition for the decidable binary relation, where the decidable predicate is defined as
an identity
representing the comparison condition for the binary relation, where the decidable predicate is defined as
an identity
representing the connectedness condition for the binary relation, where the decidable predicate is defined as
an identity
representing the asymmetry condition for the binary relation, where the decidable predicate is defined as
is called a decidable strictly ordered set.
Last revised on June 18, 2022 at 21:49:32. See the history of this page for a list of all contributions to it.