| Display title | Hasse diagram |
| Default sort key | Hasse diagram |
| Page length (in bytes) | 11,194 |
| Namespace ID | 0 |
| Page ID | 178755 |
| 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 |
| Page image |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>MedAI |
| Date of page creation | 19:09, 8 February 2024 |
| Latest editor | imported>MedAI |
| Date of latest edit | 19:09, 8 February 2024 |
| 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 order theory, a Hasse diagram (; German: [ˈhasə]) is a type of mathematical diagram used to represent a finite partially ordered set, in the form of a drawing of its transitive reduction. Concretely, for a partially ordered set $ (S,\leq ) $ one represents each element of $ S $ as a vertex in the... |
