Numerical representations of interval orders (Q5951890): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1011974420295 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W50569743 / rank
 
Normal rank

Latest revision as of 09:06, 30 July 2024

scientific article; zbMATH DE number 1687390
Language Label Description Also known as
English
Numerical representations of interval orders
scientific article; zbMATH DE number 1687390

    Statements

    Numerical representations of interval orders (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 November 2002
    0 references
    An interval order \(\prec \) on a non-empty set \(X\) is said to be representable if there are real-valued functions \(u,v: X\rightarrow R\) such that \(x\prec y\) iff \(v(x)<u(y)\), for any \(x,y\in X\). The authors of the paper under review study the structures of interval orders and their representability. They give new characterizations of the representability and show that the three main techniques used in the literature to achieve numerical representations of interval orders are equivalent.
    0 references
    ordering on a set
    0 references
    interval-orders
    0 references
    numerical representations of orderings
    0 references

    Identifiers