Abstract
In this paper, we first give the representation theory of completely algebraic lattice via appropriate ∩– structure named completely algebraic ∩ –structure algebraic lattice. Furthermore, we define a meaningful system called completely algebraic information system, firstly create the corresponding relationship between completely algebraic ∩– structure and completely algebraic information system, then we show that completely algebraic information system is a representation of completely algebraic lattice.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baranga, A.: Z – conituous Posets. Discrete Mathematics 152, 33–45 (1996)
Birkhoff, G.: Lattice Theory. American Mathematical Society, Providence (1940)
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University, Cambridge (2002)
Erne, M.: Z — continuous Posets and Their Topological Manifestation. Applied Categorical Structure 7, 31–70 (1999)
Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.S.: Continuous Lattices and Domains. Cambridge University, Cambridge (2003)
Hitzler, P., Krotzsch, M.: A Categorical View on Algebraic Lattices in Formal Concept Analysis. Fundamenta Informaticae 74, 1–29 (2006)
Hoofman, R.: Continuous Information Systems. Information and Computation 105, 42–71 (1993)
Lane, S.M.: Categories for the Working Mathematician. Springer, New York (1971)
Lei, Y.B., Luo, M.K.: Rough Concept Lattices and Domains. Annals of Pure and Applied Logic 159, 333–340 (2009)
Li, Q.G., Li, J.B.: Z – algebraic Lattices and Z – algebraic ∩ structures. Fuzzy Systems and Mathematics 22, 54–57 (2008) (in Chinese)
Raney, G.N.: Completely Distributive Complete Lattices. Proceedings of the Ameicican Mathematics Society 3, 677–680 (1952)
Rounds, W.C., Zhang, G.Q.: Clausal Logic and Logic Programming in Algebraic Domains. Information and Computation 171, 156–182 (2001)
Scott, D.S.: Domains for Denotational Semantics. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 577–643. Springer, Heidelberg (1982)
Spreen, D., Xu, L.S., Mao, X.X.: Information Systems Revisited—the General Continuous Case. Theoretical Computer Science 405, 176–187 (2008)
Venugopalan, P.: Z – continuous Posets. Houston Journal of Mathematics 12, 275–293 (1986)
Wright, J.B., Wagner, E.G., Thatcher, J.W.: A Uniform Approach to Inductive Posets and Inductive Closure. Theoretical Computer Science 7, 55–77 (1978)
Yang, L.Y., Xu, L.S.: On Rough Concept Lattice. Electronic Notes in Theoretical Computer Science 257, 117–133 (2009)
Zhang, G.Q.: Chu Spaces, Concept Lattices, and Domains. Electronic Notes in Theoretical Computer Science 83, 17 (2003)
Zhang, G.Q., Shen, G.: Approximable Concepts, Chu Spaces, and Information System. Theory and Application of Categories 17, 80–102 (2006)
Zhang, G.Q., Rounds, W.: Reasoning with Power Defaults. Theoretical Computer Science 323, 321–350 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, H., Li, Q., Guo, L. (2011). Completely Algebraic Lattices and Their Representations via ∩-structures and Information Systems. In: Wu, Y. (eds) High Performance Networking, Computing, and Communication Systems. ICHCC 2011. Communications in Computer and Information Science, vol 163. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25002-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-25002-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25001-9
Online ISBN: 978-3-642-25002-6
eBook Packages: Computer ScienceComputer Science (R0)