vault backup: 2026-03-07 10:39:20
This commit is contained in:
@@ -45,6 +45,6 @@ A binary relation is a relation $R$ between _exactly two_ elements $a in R$ and
|
|||||||
An **Order** is a mathematical way to sort, rank or compare elements within a set, where some elements come "before" and "after" others.
|
An **Order** is a mathematical way to sort, rank or compare elements within a set, where some elements come "before" and "after" others.
|
||||||
|
|
||||||
A _binary relation_ is called an order if it is...
|
A _binary relation_ is called an order if it is...
|
||||||
- [x] a *reflexive relation*
|
- [!] a *reflexive relation*
|
||||||
- [x] a *antisymmetric relation*
|
- [!] a *antisymmetric relation*
|
||||||
- [ ] a *transitive relation*
|
- [!] a *transitive relation*
|
||||||
|
|||||||
Reference in New Issue
Block a user