An algorithmic proof that semiorders are representable (Q3990620)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithmic proof that semiorders are representable |
scientific article; zbMATH DE number 38397
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithmic proof that semiorders are representable |
scientific article; zbMATH DE number 38397 |
Statements
An algorithmic proof that semiorders are representable (English)
0 references
28 June 1992
0 references
preference patterns with intransitive indifference
0 references
asymmetric digraph
0 references
semiorder
0 references
