partially ordered set

Set ordered by a transitive, antisymmetric, and reflexive binary relation

EntityQ474715

Also known as poset · ordered set

Subclass of: preordered set

Overview

From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0

In mathematics, especially order theory, a partial order on a set is an arrangement such that, for certain pairs of elements, one precedes the other. The word partial is used to indicate that not every pair of elements needs to be comparable; that is, there may be pairs for which neither element precedes the other. Partial orders thus generalize total orders, in which every pair is comparable.

Overview

All data

26 statements · 23% with external sources · numbers in brackets are citations

Different from: partial order
Studied by: order theory
Underlying structure: set
Members / parts: partial order

On other databases

18 identifiers linking partially ordered set across the web's reference databases

Data quality

statements

23%

externally sourced

Source last edited August 16, 2026. AIDb refreshes this page daily.

Suggest a fact or correction

Links

Use this data

curl https://aidb.si/api/v1/entities/Q474715

API docs, limits & keys

Cite this page

AIDb. (2026). partially ordered set (Q474715). Retrieved from https://aidb.si/e/partially-ordered-set-Q474715