Abstract
In [6], 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 [7], Scott discussed continuous lattices primarily from a topological point of view. However, buried in [7] 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 [5]. Finally, we discuss a number of constructions which construct posets with a basis from posets with bases.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Birkoff, G. Lattice Theory, 3rd ed., Amer. Math. Soc., Providence, RI, 1967.
Crawley, P. and R. P. Dilworth, Algebraic Theory of Lattices Prentice-Hall, Inc., Englewood Cliffs, NJ, 1973.
Egli, H. and Constable, R. L., "Computability Concepts for Programming Language Semantics," Theoretical Comp. Science, 2 (1976) 133–145.
Markowsky, G., "Chain-complete Posets and Directed Sets with Applications," Algebra Universal, 6 (1976) 53–68.
Markowsky, G. and Rosen, B. K., "Bases for Chain-complete Posets," IBM J. of Res. and Development, 20 (March, 1976) 138–147.
Scott, D., "Outline of a Mathematical Theory of Computation," Proc. 4th Ann. Princeton Conf. on Inform Sci. and Systems, 1970, 169–176.
Scott, D., "Continuous Lattices," Proc. Dalhousie Conf. on Toposes, Algebraic Geometry and Logic, Lecture Notes in Mathematics 274, Springer-Verlag, Berlin, 1972, 97–136.
Vuillemin, J., Syntaxe, Semantique, et Axiomatique d'un Language de Programmation Simple, These d'etat, University of Paris, Sept. 1974.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Markowsky, G. (1981). A motivation and generalization of scott's notion of a continuous lattice. In: Banaschewski, B., Hoffmann, RE. (eds) Continuous Lattices. Lecture Notes in Mathematics, vol 871. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0089913
Download citation
DOI: https://doi.org/10.1007/BFb0089913
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10848-1
Online ISBN: 978-3-540-38755-8
eBook Packages: Springer Book Archive