Advertisement

Union complete countable subset systems

  • P. Venugopalan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 239)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    B. Banaschewski, E. Nelson, Completions of partially ordered sets, SIAM J. Comput. 11(1982), 521–528.Google Scholar
  2. [2]
    G. Markowsky, Chain-complete posets and directed sets with applications, Algebra Universalis, 6(1976), 138–147.Google Scholar
  3. [3]
    J. Meseguer, Order completion monads, Algebra Universalis, 16(1983), 63–82.Google Scholar
  4. [4]
    D. Novak, On a duality between the concepts of "finite" and "directed", Houston J. Math. 8(1982), 545–563.Google Scholar
  5. [5]
    G.N. Raney, A subdirect-union representation for completely distributive lattices, Proc. Amer. Math. Soc. 4(1953), 518–522.Google Scholar
  6. [6]
    D. Scott, Continuous lattices, Toposes, Algebraic Geometry and Logic, Lecture Notes in Math, Vol. 274, Springer-Verlag, New York, 1972, 97–136.Google Scholar
  7. [7]
    P. Venugopalan, Z-continuous posets, Houston J. Math. (to appear).Google Scholar
  8. [8]
    J.B. Wright, E.G. Wagner, and J.W. Thatcher, A uniform approach to inductive posets and inductive closure, Theor. Comp. Sci., 7(1978), 57–77.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • P. Venugopalan
    • 1
  1. 1.University of ConnecticutStamford

Personalised recommendations