×

On some interpolation rules for lattice ordered groups. (English) Zbl 1080.06028

Summary: Let \(\alpha \) be an infinite cardinal. In this paper we define an interpolation rule \(\text{IR}(\alpha )\) for lattice-ordered groups. We denote by \(C(\alpha )\) the class of all lattice-ordered groups satisfying \(\text{IR}(\alpha )\), and prove that \(C (\alpha )\) is a radical class.

MSC:

06F15 Ordered groups
PDF BibTeX XML Cite
Full Text: DOI EuDML

References:

[1] P. F. Conrad: Lattice Ordered Groups. Tulane University, 1970. · Zbl 0258.06011
[2] P. F. Conrad: \(K\)-radical classes of lattice ordered groups. Proc. Conf. Carbondale (1980), Lecture Notes Math. Vol. 848, 1981, pp. 186-207. · Zbl 0455.06010
[3] M. R. Darnel: \(\sigma \)-interpolation lattice-ordered groups. Czechoslovak Math. J. 50 (2000), 1-2. · Zbl 1035.06004
[4] M. R. Darnel and J. Martinez: Radical classes of lattice ordered groups vs. classes of compact spaces. Order 19 (2002), 35-72. · Zbl 1011.06018
[5] K. R. Goodearl: Partially Ordered Abelian Groups with Interpolation. Math. Surveys and Monographs, No. 20. Amer. Math. Soc., Providence, 1986.
[6] Ch. W. Holland: Varieties of \(\ell \)-groups are torsion classes. Czechoslovak Math. J. 29 (1979), 11-12. · Zbl 0432.06011
[7] J. Jakubík: Radical mappings and radical classes of lattice ordered groups. Symposia Math. 21 (1977), 451-477.
[8] J. Jakubík: On some completeness properties for lattice ordered groups. Czechoslovak Math. J. 45 (1995), 253-266. · Zbl 0835.06019
[9] N. Ja. Medvedev: On the lattice of radicals of a finitely generated \(\ell \)-group. Math. Slovaca 33 (1983), 185-188. · Zbl 0513.06009
[10] R. C. Walker: The Stone-Čech Compactification. Ergebn. Math. 80. Springer-Verlag, Berlin-Heidelberg-New York, 1974.
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.