Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1990: Mathematical Foundations of Computer Science 1990 pp 446–456Cite as

A sup-preserving completion of ordered partial algebras

  • Communications
  • Conference paper
  • First Online:

  • 760 Accesses

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

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. Adamek, J., Construction of free ordered algebras, Alg. Universalis. 14 (1982) 140–166.

    Google Scholar 

  2. Adamek, J., Nelson, E., Reiterman, J., Tree construction of free continuous algebras, J. of Comp. and System Sci. 24/1 (1982) 114–146.

    Google Scholar 

  3. ADJ (=Goguen, J.A., Thatcher, J.W., Wagner, E.G., and Wright, J.B.), Some fundamentals of order-algebraic Semantics, Proc. Symp. Math. Found. of Comp. Sci. Gdansk, Poland, Sept. 1976, Springer Lecture Notes in Computer Science 45 (1976) 153–168.

    Google Scholar 

  4. ADJ, Initial algebra semantics and continuous theories, J.A.C.M. 24 (1977) 68–95.

    Google Scholar 

  5. ADJ, Free continuous theories, IBM Res. Report 6909, Yorktown heights, 1977.

    Google Scholar 

  6. ADJ, A uniform approach to inductive posets and inductive closure, in Math. Found. of Comp. Sci., Springer Lecture Notes in Computer Science 53 and also in T.C.S. 7 (1978) 57–77.

    Google Scholar 

  7. Andreka, H., Nemeti, I.: Generalization of the concept of variety and quasivariety to partial algebras through category theory. Dissertationes Mathematicae (Rozprawy Math.) No CCIV, Polish Scientific Publishers, Warszawa 1981, 101 p.

    Google Scholar 

  8. Arnold, A., Nivat, M., Metric interpretations of recursive program schemes, Proc. 2nd workshop on categorical and algebraic methods in Comp. Sci., Dortmund 1978, 11–22.

    Google Scholar 

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

    Google Scholar 

  10. Bloom, S.L., Varieties of ordered algebras, J.C.S.S. 13 (1976) 200–212.

    Google Scholar 

  11. Burmeister, P.: Primitive Klassen partieller Algebren, Habilitationsschrift, Univ. Bonn, 1971.

    Google Scholar 

  12. Burmeister, P., Schmidt, J.: On the completion of partial algebras, Colloquium Mathematicum Vol. XVII, 1967, 235–245.

    Google Scholar 

  13. Guessarian, I., On continuous completions, Proc. 4th GI, Springer Lecture Notes in Computer Science 67 (1979) 142–152.

    Google Scholar 

  14. Herrlich, H., Strecker, G.E., Category Theory, Allyn and Bacon Inc., Boston, 1973

    Google Scholar 

  15. Isbell, J.R., Epimorphisms and dominions, Proc. Conf. on Categorical Algebra, La Jolla, Calif. (1965), Springer-Verlag, Berlin-New York (1966).

    Google Scholar 

  16. Jarzembski, G., Free ω-continuous algebras, Alg. Universalis. 14 (1982) 231–234.

    Google Scholar 

  17. Lehmann, D., On the algebra of order, J.C.S.S. 21/1 (1980) 1–23.

    Google Scholar 

  18. Lehmann, D., Pasztor, A., Epis need not be dense, Theoretical Computer Science 17 (1982) 151–161.

    Google Scholar 

  19. Markowsky, G., Categories of chain-complete p.o. sets, Theoretical Computer Science 4 (1977) 125–135.

    Google Scholar 

  20. Meseguer, J., Completions, factorizations and colimits for ω — posets, Coll. Math. Soc. Janos Bolyai 26.

    Google Scholar 

  21. Meseguer, J., On order-complete universal algebra and enriched functorial semantics, in Proc. FCT 77, Springer Lecture Notes in Computer Science 56 (1977) 294–301.

    Google Scholar 

  22. Meseguer, J., Varieties of chain-complete algebras, J. of Pure and Applied Alg. 19 (1980) 347–383.

    Google Scholar 

  23. Nelson, E.: Free Z — continuous Algebras, “Proceedings, Workshop on Continuous Lattices”, Springer Lecture Notes in Mathematics 871, 315–334, 1981.

    Google Scholar 

  24. Pasztor, A.: Faktorisierungssysteme inder Kategorie del partiellen Algebren — Kennzeichnung von (Homo) Morphismenklassen, HochschulVerlag — Freiburg — 1979.

    Google Scholar 

  25. Pasztor, A.: Epis of some categories of Z — continuous partial algebras, Acta Cybemetica VI/1 (1983).

    Google Scholar 

  26. Pasztor, A., The epis of Pos(Z), Comment. Math. Univ. Carol., 23/2 (1982) 285–299.

    Google Scholar 

  27. Pasztor, A., Ordered algebras are monoreflective in the category of ordered partial algebras, Proc. 7th Coll. on Trees in Alg. and Progr., March 4–6, 1982, Lille, France.

    Google Scholar 

  28. Pasztor, A., Chain-continuous algebras — a variety of partial algebras, Fundamenta Informaticae vi/3 (1983).

    Google Scholar 

  29. Pasztor, A., “On P-dominions of continuous algebras,” Journal of Pure and Applied Algebra 41 (1986) 263–283.

    Google Scholar 

  30. Schmidt, J., Universal Algebra, Manuscript, Univ. of Georgia, Athens, GA 1967/68.

    Google Scholar 

  31. Scott, D., Outline of a Math Theory of Computation, Proc. 4th Ann. Princeton Conf. on Inf. Sci. and Systems (1969) 169–176.

    Google Scholar 

  32. Scott, D., The lattice of flow diagrams, Semantics of Algorithmic Lang., Springer Lecture Notes in Mathematics 188 (1971) 311–366.

    Google Scholar 

  33. Scott, D., Data Types as Lattices, SIAM J. Comp. 5 (1976) 522–587.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Florida International University, University Park, 33199, Miami, FL

    Ana Pasztor

Authors
  1. Ana Pasztor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pasztor, A. (1990). A sup-preserving completion of ordered partial algebras. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029641

Download citation

  • DOI: https://doi.org/10.1007/BFb0029641

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52953-8

  • Online ISBN: 978-3-540-47185-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation