In mathematics, a total order, simple order, linear order, connex order, or full order is a binary relation on some set , which is antisymmetric, transitive, and a connex relation. A set paired with a total order is called a chain, a totally ordered set, a simply ordered set, a linearly ordered set, or a loset. Formally, a binary relation is a total order on a set if the following statements hold for all and in : AntisymmetryIf and then ;TransitivityIf and then ;Connexity or .

Property Value
dbo:abstract
• In mathematics, a total order, simple order, linear order, connex order, or full order is a binary relation on some set , which is antisymmetric, transitive, and a connex relation. A set paired with a total order is called a chain, a totally ordered set, a simply ordered set, a linearly ordered set, or a loset. Formally, a binary relation is a total order on a set if the following statements hold for all and in : AntisymmetryIf and then ;TransitivityIf and then ;Connexity or . Antisymmetry eliminates uncertain cases when both precedes and precedes . A relation having the connex property means that any pair of elements in the set of the relation are comparable under the relation. This also means that the set can be diagrammed as a line of elements, giving it the name linear. The connex property also implies reflexivity, i.e., a ≤ a. Therefore, a total order is also a (special case of a) partial order, as, for a partial order, the connex property is replaced by the weaker reflexivity property. An extension of a given partial order to a total order is called a linear extension of that partial order. (en)
dbo:wikiPageID
• 30330 (xsd:integer)
dbo:wikiPageLength
• 17813 (xsd:integer)
dbo:wikiPageRevisionID
• 982725041 (xsd:integer)
dbp:id
• Total_order&oldid=35332 (en)
dbp:title
• Totally ordered set (en)
dbp:wikiPageUsesTemplate
dct:subject
rdfs:comment
• In mathematics, a total order, simple order, linear order, connex order, or full order is a binary relation on some set , which is antisymmetric, transitive, and a connex relation. A set paired with a total order is called a chain, a totally ordered set, a simply ordered set, a linearly ordered set, or a loset. Formally, a binary relation is a total order on a set if the following statements hold for all and in : AntisymmetryIf and then ;TransitivityIf and then ;Connexity or . (en)
rdfs:label
• Total order (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of