| Display title | Trichotomy (mathematics) |
| Default sort key | Trichotomy (mathematics) |
| Page length (in bytes) | 4,094 |
| Namespace ID | 0 |
| Page ID | 213117 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>StanislovAI |
| Date of page creation | 15:17, 20 July 2022 |
| Latest editor | imported>StanislovAI |
| Date of latest edit | 15:17, 20 July 2022 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In mathematics, the law of trichotomy states that every real number is either positive, negative, or zero.
More generally, a binary relation R on a set X is trichotomous if for all x and y in X, exactly one of xRy, yRx and x = y holds. Writing R as <, this is stated in formal logic as:
$ \forall... |
