×

Maximal compatible extensions of partial orders. (English) Zbl 1109.06001

The authors investigate partial orders compatible with the operation \(f\) of a given monounary algebra \((A,f)\), i.e. partial orders \(\leq\) such that \(x\leq y\) implies \(f(x)\leq f(y)\) for all \(x,y\in A\). They give a complete description of maximal (with respect to containment) compatible partial orders on \((A,f)\). Those are exactly the so-called \(f\)-quasilinear partial orders. It is shown (Theorem 4.2) that if \((A,f,\leq)\) is a partially ordered monounary algebra, then there exists a compatible partial order on \((A,f)\) that is an extension of \(\leq\) and is \(f\)-quasilinear.
Reviewer’s note. G. Rubanovich described all possible compatible linear orders on a monounary algebra. He gave a method of their construction and obtained their total number [see G. Rubanovich, Uch. Zap. Tartu. Gos. Univ. 281, Trudy Mat. Mekh. 11, 34–48 (1971; Zbl 0331.06011)].

MSC:

06A06 Partial orders, general
08A60 Unary algebras
06F25 Ordered rings, algebras, modules

Citations:

Zbl 0331.06011
Full Text: DOI

References:

[1] DOI: 10.1016/S0165-4896(01)00077-4 · Zbl 1023.91012 · doi:10.1016/S0165-4896(01)00077-4
[2] DOI: 10.1007/BF02783429 · Zbl 1044.03043 · doi:10.1007/BF02783429
[3] DOI: 10.1007/s11083-005-9022-9 · Zbl 1097.06005 · doi:10.1007/s11083-005-9022-9
[4] Bonnet, Ordered Sets pp 125– (1982) · doi:10.1007/978-94-009-7798-3_4
[5] Körtesi, Math. Pannon. 16 pp 39– (2005)
[6] Szigeti, Order 4 pp 31– (1987)
[7] DOI: 10.1023/A:1022424931030 · Zbl 1079.06500 · doi:10.1023/A:1022424931030
[8] DOI: 10.1155/S1173912602000111 · Zbl 1038.06001 · doi:10.1155/S1173912602000111
[9] Szpilrajn, Fund. Math. 16 pp 386– (1930)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.