Propaedeutic to chain-complete posets with basis

  • George Markowsky
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 871)


In this paper, several relations between members of a chain-complete poset (weaker than the relations relatively compact and IN introduced by Scott in his study of bases) are considered, with an eye toward examining whether all the properties of bases can be obtained from weaker axioms. It turns out that for all but one relation (relatively chain compact) one gets a weaker notion of bases than using relatively compact or IN. For relatively chain compact we conjecture that one gets a weaker notion of basis. However, we show that in the presence of bounded joins the existence of a basis derived from the relation of relatively chain compact implies the existence of a Scott basis if the cardinality of the chain-complete poset is less than the ω-th infinite cardinal. If one accepts the Continuum Hypothesis this means that the weaker relation is adequate in many posets likely to be of interest to computer science. Finally, even in the presence of the "weaker" type of basis in a complete lattice, the meet operation is continuous.


Local Basis Complete Lattice Continuum Hypothesis Continuous Lattice Weak Notion 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A]
    Astesiano, E., "Bases for Scott-continuous Posets," Universita di Genova, Pubblicazioni dell' Instituto di Matematica No. (181) 1976.Google Scholar
  2. [EC]
    Egli, H. and Constable, R. L., "Computability Concepts for Programming Language Semantics," Theoretical Comp. Science, 2 (1976) 133–145.MathSciNetCrossRefzbMATHGoogle Scholar
  3. [M1]
    Markowsky, G., "Chain-complete Posets and Directed Sets with Applications," Algebra Universalis 6 (1976) 53–68.MathSciNetCrossRefzbMATHGoogle Scholar
  4. [M2]
    Markowsky, G., "A Motivation and Generalization of Scott's Notion of a Continuous Lattice," These Proceedings.Google Scholar
  5. [MR]
    Markowsky, G. and Rosen, B. K., "Bases for Chain-complete Posets," IBM J. of Res. and Dev., 20 (March, 1976) 138–147.MathSciNetCrossRefzbMATHGoogle Scholar
  6. [R1]
    Reynolds, J. "Notes on a Lattice-theoretic Approach to the Theory of Computation," Lecture Notes, Syracuse U., October, 1972.Google Scholar
  7. [R2]
    Reynolds J., "On the Interpretation of Scott Domains" Symp. Math. 15 (1975) 123–135.Google Scholar
  8. [S1]
    Scott, D., "Outline of a Mathematical Theory of Computation," Proc. 4th Ann. Princeton Conf. on Inform. Sci. and Systems, 1970, 169–176.Google Scholar
  9. [S2]
    Scott, D., "Continuous Lattices," Proc. Dalhousie Conf. on Toposes, Algebraic Geometry and Logic, Lecture Notes in Mathematics 274, Springer-Verlag, Berlin, 1972, 97–136.CrossRefGoogle Scholar
  10. [S3]
    Scott, D., "Data Types as Lattices," SIAM J. Comput. 5 (1976) 522–587.MathSciNetCrossRefzbMATHGoogle Scholar
  11. [SM]
    Smyth, M., "Effectively Given Domains," Theoretical Comp. Science 5 (1977) 257–274.MathSciNetCrossRefzbMATHGoogle Scholar
  12. [V]
    Vuillemin, J., Syntaxe, Semantique, et Axiomatique d'un Language de Programmation Simple, These d'etat, University of Paris, Sept. 1974.Google Scholar

Copyright information

© Springer-Verlag 1981

Authors and Affiliations

  • George Markowsky
    • 1
  1. 1.IBM Thomas J. Watson Research CenterYorktown Heights

Personalised recommendations