An algorithmic proof that semiorders are representable (Q3990620)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An algorithmic proof that semiorders are representable
scientific article

    Statements

    An algorithmic proof that semiorders are representable (English)
    0 references
    0 references
    28 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    preference patterns with intransitive indifference
    0 references
    asymmetric digraph
    0 references
    semiorder
    0 references
    0 references