List of order structures in mathematics
In mathematics, and more specifically in order theory, several different types of ordered set have been studied.They include:
* Cyclic orders, orderings in which triples of elements are either clockwise or counterclockwise
* Lattices, partial orders in which each pair of elements has a greatest lower bound and a least upper bound. Many different types of lattice have been studied; see map of lattices for a list.
* Partially ordered sets (or posets), orderings in which some pairs are comparable and others might not be
* Preorders, a generalization of partial orders allowing ties (represented as equivalences and distinct from incomparabilities)
* Semiorders, partial orders determined by comparison of numerical values, in which values that are too close to each other are incomparable; a
Wikipage disambiguates
Wikipage redirect
Absolute space and timeAbsorption lawAbstract interpretationCantor's paradoxConflict-free replicated data typeEmbeddingEmpty setErnst SchröderFelix HausdorffGlossary of mathematical symbolsHierarchy (mathematics)Inclusion–exclusion principleIndex of philosophy articles (I–Q)Inequality (mathematics)K-frameKilled processLadislav SkulaLaws of FormLinked data structureList of first-order theoriesList of order structuresList of types of ordered setLogical formMaxima and minimaMonotonic functionMorley rankMystic chordOrderOrder (mathematics)Order typeOrdered setPAM libraryPCF theoryPermutation (music)Real-valued functionSet theory (music)Single crossing conditionStable theory
Link from a Wikipage to another Wikipage
primaryTopic
List of order structures in mathematics
In mathematics, and more specifically in order theory, several different types of ordered set have been studied.They include:
* Cyclic orders, orderings in which triples of elements are either clockwise or counterclockwise
* Lattices, partial orders in which each pair of elements has a greatest lower bound and a least upper bound. Many different types of lattice have been studied; see map of lattices for a list.
* Partially ordered sets (or posets), orderings in which some pairs are comparable and others might not be
* Preorders, a generalization of partial orders allowing ties (represented as equivalences and distinct from incomparabilities)
* Semiorders, partial orders determined by comparison of numerical values, in which values that are too close to each other are incomparable; a
has abstract
In mathematics, and more speci ...... s generalizing the well-orders
@en
Впорядко́вана множина́ — множи ...... еревершує , то не перевершує .
@uk
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
945,896,900
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
In mathematics, and more speci ...... ach other are incomparable; a
@en
Впорядко́вана множина́ — множи ...... еревершує , то не перевершує .
@uk
label
List of order structures in mathematics
@en
Впорядкована множина
@uk