Skip to main content
Log in

New representations of algebraic domains and algebraic L-domains via closure systems

  • RESEARCH ARTICLE
  • Published:
Semigroup Forum Aims and scope Submit manuscript

Abstract

Closure systems (spaces) play an important role in characterizing certain ordered structures. In this paper, FinSet-bounded algebraic closure spaces are introduced, and then used to provide a new approach to constructing algebraic domains. Then, a special family of algebraic closure spaces, algebraic L-closure spaces, are used to represent algebraic L-domains. Next, algebraic approximate mappings are defined and serve as the appropriate morphisms between algebraic closure spaces, respectively, algebraic L-closure spaces. On the categorical level, we show that algebraic closure spaces (respectively, algebraic L-closure spaces,) each equipped with algebraic approximate mappings as morphisms, are equivalent to algebraic domains (respectively, algebraic L-domains) with Scott continuous functions as morphisms.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. In this paper, for any set X, we write \(F\sqsubseteq X\) to denote that F is a finite subset of X,

References

  1. Birkhoff, G.: Lattice Theory, 3rd edn. American Mathematical Society, Providence (1967)

    MATH  Google Scholar 

  2. Caspard, N., Monjardet, B.: Some lattices of closure systems on a finite set. Discr. Math. Theor. Comput. Sci. 6, 163–190 (2004)

    MathSciNet  MATH  Google Scholar 

  3. Caspard, N., Monjardet, B.: The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey. Discr. Appl. Math. 127, 241–269 (2003)

    Article  MathSciNet  Google Scholar 

  4. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)

    Book  Google Scholar 

  5. Edelman, P.H.: Meet-distributive lattices and the anti-exchange closure. Algebra Univ. 10, 290–299 (1980)

    Article  MathSciNet  Google Scholar 

  6. Edelman, P.H., Saks, M.E.: Combinatorial representation and convex dimension of convex geometries. Order 5, 23–32 (1988)

    Article  MathSciNet  Google Scholar 

  7. Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M.W., Scott, D.S.: Continuous Lattices and Domains. Cambridge University Press, Cambridge (2003)

    Book  Google Scholar 

  8. Guo, L.K., Li, Q.G.: The categorical equivalence between algebraic domains and F-augmented closure spaces. Order 32, 101–116 (2015)

    Article  MathSciNet  Google Scholar 

  9. Hofmann, K.H., Stralka, A.R.: The algebraic theory of compact Lawson semilattices: applications of Galois connections to compact semilattices. Dissert. Math. 137, 1–54 (1976)

    MathSciNet  MATH  Google Scholar 

  10. Larsen, K.G., Winskel, G.: Using information systems to solve domain equations effectively. In: Kahn, G., MacQueen, D.B., Plotkin, G. (eds.) Semantics of Data Types. Lecture Notes in Computer Science, vol. 173, pp. 109–129. Springer, Berlin (1984)

  11. Lei, Y., Luo, M.: Rough concept lattices and domains. Ann. Pure Appl. Logic 159, 333–340 (2009)

    Article  MathSciNet  Google Scholar 

  12. Pfaltz, J.L.: Closure lattices. Discr. Math. 154, 217–236 (1996)

    Article  MathSciNet  Google Scholar 

  13. Pfaltz, J.L., Jamison, R.E.: Closure systems and their structure. Inf. Sci. 139(3–4), 275–286 (2001)

    Article  MathSciNet  Google Scholar 

  14. Raney, G.N.: Completely distributive complete lattices. Proc. Am. Math. Soc. 3(5), 677–680 (1952)

    Article  MathSciNet  Google Scholar 

  15. Scott, D.: Continuous lattices. In: Lawvere, F.W. (ed.) Toposes, Algebraic Geometry and Logic. Lecture Notes in Mathematics, vol. 274, pp. 97–136. Springer, Berlin (1972)

  16. Winskel, G.: An introduction to event structures. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Lecture Notes in Computer Science, vol. 354, pp. 364–397. Springer, Berlin (1989)

  17. Zhao, D.S.: Closure spaces and completions of posets. Semigroup Forum 90, 543–555 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work is supported by the National Natural Science Foundation of China (No. 11771134). We would like to thank the anonymous reviews for their helpful comments and valuable suggestions. Moreover, we are very grateful to our editor Michael Mislove for his many help in the processing of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qingguo Li.

Additional information

Communicated by Michael Mislove.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wu, M., Guo, L. & Li, Q. New representations of algebraic domains and algebraic L-domains via closure systems. Semigroup Forum 103, 700–712 (2021). https://doi.org/10.1007/s00233-021-10209-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00233-021-10209-7

Keywords

Navigation