About: List of order structures in mathematics     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FList_of_order_structures_in_mathematics&invfp=IFP_OFF&sas=SAME_AS_OFF

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

AttributesValues
rdfs:label
  • List of order structures in mathematics (en)
  • Впорядкована множина (uk)
rdfs:comment
  • Впорядко́вана множина́ — множина для будь-яких двох елементів , якої встановлено одне з наступних відношень порядку: або ( не перевищує ),або ( не перевищує ), з наступними властивостями: 1. * рефлексивність: будь-який елемент множини не перевершує самого себе; 2. * антисиметричність: якщо не перевершує , а не перевершує , то елементи і збігаються; 3. * транзитивність: якщо не перевершує , а не перевершує , то не перевершує . (uk)
  • 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 (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • 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 subfamily of partial orders with certain restrictions * Total orders, orderings that specify, for every two distinct elements, which one is less than the other * Weak orders, generalizations of total orders allowing ties (represented either as equivalences or, in strict weak orders, as transitive incomparabilities) * Well-orders, total orders in which every non-empty subset has a least element * Well-quasi-orderings, a class of preorders generalizing the well-orders (en)
  • Впорядко́вана множина́ — множина для будь-яких двох елементів , якої встановлено одне з наступних відношень порядку: або ( не перевищує ),або ( не перевищує ), з наступними властивостями: 1. * рефлексивність: будь-який елемент множини не перевершує самого себе; 2. * антисиметричність: якщо не перевершує , а не перевершує , то елементи і збігаються; 3. * транзитивність: якщо не перевершує , а не перевершує , то не перевершує . (uk)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is Wikipage disambiguates of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software