On continuous noncomplete lattices.
A complete lattice \(L\) is said to be continuous if it is both meet and join continuous. Such lattices appear also in the mathematical theory of computation as a model of \(\lambda \)-calculus, where only topological aspects of these lattices are essential. In Algebra Logic 11, 203--242 (1972); translation from Algebra Logika 11, 367--437 (1972; Zbl 0285.02040), \textit{Yu. L. Ershov} introduced so-called \(A\)-spaces generalizing noncomplete version of continuity. In the present paper the authors consider some facts known for continuous lattices remaining true also in the noncomplete case. Several examples of noncomplete lattices that are algebraic or continuous are given. It is shown that finitely generated free lattices are algebraic. The last part of the paper is devoted to a study of the Lawson topology on a finitely presented lattice. It is proved that it coincides with the dual Lawson topology and the interval topology provided that the lattice is algebraic.
This page was built for publication: On continuous noncomplete lattices.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1771870)
