×

Increasing and decreasing operators on complete lattices. (English) Zbl 0343.06009


MSC:

06B23 Complete lattices, completions
06A15 Galois correspondences, closure operators (in relation to ordered sets)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Banachewski, B.; Bruns, G., Categorical characterization of the MacNeille completion, Arch. Math., 18, 369-377 (1967) · Zbl 0157.34101
[2] Benado, M., Ensembles ordonnés et fonctions monotones, Rev. Fac. Ci. Univ. Lisboa II, Ser. A, 14 (1972) · Zbl 0265.06002
[3] Berge, C., Topological Spaces (1963), Macmillan Co.,: Macmillan Co., New York · Zbl 0114.38602
[4] Birkhoff, G., Lattice Theory, (American Mathematical Colloquium Publications (1967), American Mathematical Society: American Mathematical Society Providence, R.I.) · Zbl 0126.03801
[5] Blyth, T. S.; Janowitz, M. F., Residuation Theory (1972), Pergamon: Pergamon Oxford · Zbl 0301.06001
[6] Crapo, H., Ordered Sets: Retracts and Connections (1972), Department of Pure Mathematics, University of Waterloo · Zbl 0474.06004
[7] Ore, O., Combinations of closure relations, Ann. of Math., 44, 514-533 (1943) · Zbl 0060.06203
[8] Ore, O., Galois connexions, Trans. Amer. Math. Soc., 55, 493-513 (1944) · Zbl 0060.06204
[9] Pickert, G., Bemerkungen über Galois-Verbindungen, Arch. Math., 3, 285-289 (1952) · Zbl 0047.26402
[10] Shmuely, Z., The structure of galois connections, Pacific J. Math., 54, 2, 209-225 (1974) · Zbl 0275.06003
[11] Tarski, A., A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math., 5, 285-309 (1955) · Zbl 0064.26004
[12] Ward, M., The closure operators of a lattice, Ann. of Math., 43, 2, 191-196 (1942) · Zbl 0063.08179
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.