A motivation and generalization of scott's notion of a continuous lattice
In , Scott introduced continuous lattices as the correct setting for an abstract theory of computation. The motivation and definition of continuous lattices was primarily in topological terms. In , Scott discussed continuous lattices primarily from a topological point of view. However, buried in  is an indication (without proof) of how to approach continuous lattices from a purely order-theoretic perspective. This order-theoretic approach seems to have escaped the notice of most computer scientists. We develop this approach in the more general setting of chain-complete posets and offer some arguments in support of the thesis that "continuous posets" (chain-complete posets with a basis) are the proper setting for an abstract theory of computation. Our definition of basis also generalizes that used by Markowsky and Rosen . Finally, we discuss a number of constructions which construct posets with a basis from posets with bases.
KeywordsLocal Basis Finite Subset Continuous Lattice Compact Element Infinite Word
Unable to display preview. Download preview PDF.
- Birkoff, G. Lattice Theory, 3rd ed., Amer. Math. Soc., Providence, RI, 1967.Google Scholar
- Scott, D., "Outline of a Mathematical Theory of Computation," Proc. 4th Ann. Princeton Conf. on Inform Sci. and Systems, 1970, 169–176.Google Scholar
- Vuillemin, J., Syntaxe, Semantique, et Axiomatique d'un Language de Programmation Simple, These d'etat, University of Paris, Sept. 1974.Google Scholar