Skip to main content
SpringerLink
Log in
Book cover

International Conference on Mathematical Foundations of Programming Semantics

MFPS 1985: Mathematical Foundations of Programming Semantics pp 342–356Cite as

Union complete countable subset systems

  • Conference paper
  • First Online:

  • 158 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 239))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Banaschewski, E. Nelson, Completions of partially ordered sets, SIAM J. Comput. 11(1982), 521–528.

    Google Scholar 

  2. G. Markowsky, Chain-complete posets and directed sets with applications, Algebra Universalis, 6(1976), 138–147.

    Google Scholar 

  3. J. Meseguer, Order completion monads, Algebra Universalis, 16(1983), 63–82.

    Google Scholar 

  4. D. Novak, On a duality between the concepts of "finite" and "directed", Houston J. Math. 8(1982), 545–563.

    Google Scholar 

  5. G.N. Raney, A subdirect-union representation for completely distributive lattices, Proc. Amer. Math. Soc. 4(1953), 518–522.

    Google Scholar 

  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. P. Venugopalan, Z-continuous posets, Houston J. Math. (to appear).

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. University of Connecticut, Scofieldtown Road, 06903, Stamford, CT

    P. Venugopalan

Authors
  1. P. Venugopalan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Austin Melton

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Venugopalan, P. (1986). Union complete countable subset systems. In: Melton, A. (eds) Mathematical Foundations of Programming Semantics. MFPS 1985. Lecture Notes in Computer Science, vol 239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16816-8_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-16816-8_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16816-4

  • Online ISBN: 978-3-540-44861-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation