
doi: 10.1007/bf02583001
Summary: \textit{H. Crapo} [J. Pure Appl. Algebra 23, 13-28 (1982; Zbl 0474.06004)] raised the following problem: If P is a complete lattice, is Retr(P) a complete lattice? Here Retr(P) denotes the set of all retraction operators on P with the pointwise order, that is, \(f\leq g\) in Retr(P) iff f(x)\(\leq g(x)\) for every x in P. An affirmative answer is given in the present paper.
complete lattice, retraction operators, Complete lattices, completions
complete lattice, retraction operators, Complete lattices, completions
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
