On the semilattice of weak orders of a set (Q760318): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0165-4896(84)90098-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070442029 / rank | |||
Normal rank | |||
Revision as of 21:49, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the semilattice of weak orders of a set |
scientific article |
Statements
On the semilattice of weak orders of a set (English)
0 references
1984
0 references
A weak order on a set X is a binary relation P that is reflexive, transitive and total in that for x,y\(\in X\), xPy or yPx. Order theoretic and combinatorial properties of the semilattice of weak orders on a set are developed. In the case of a finite set, an order theoretic characterization of this semilattice is obtained. Though it is not specifically mentioned in the paper, it follows from property (F2) on p. 234, that the semilattice of weak orders on a finite set X is isomorphic to the semilattice of chains from \(\emptyset\) to X in the power set of X.
0 references
residuated mapping
0 references
preference relation
0 references
weak order
0 references
binary relation
0 references
semilattice
0 references
