m-Algebraic lattices in formal concept analysis

The notion of an m-algebraic lattice, where m stands for a cardinal number, includes numerous special cases, such as complete lattice, algebraic lattice, and prime algebraic lattice. In formal concept analysis, one fundamental result states that every concept lattice is complete, and conversely, each complete lattice is isomorphic to a concept lattice. In this paper, we introduce the notion of an m-approximable concept on each context. The m-approximable concept lattice derived from the notion is an m-algebraic lattice, and conversely, every m-algebraic lattice is isomorphic to an m-approximable concept lattice of some context. Morphisms on m-algebraic lattices and those on contexts are provided, called m-continuous functions and m-approximable morphisms, respectively. We establish a categorical equivalence between LATm, the category of m-algebraic lattices and m-continuous functions, and CXTm, the category of contexts and mapproximable morphisms.We prove that LATm is cartesian closed whenevermis regular and m > 2. By the equivalence of LATm and CXTm, we obtain that CXTm is also cartesian closed under same circumstances. The notions of a concept, an approximable concept, and a weak approximable concept are showed to be special cases of that of an m-approximable concept.

[1]  ON COUNTABLY APPROXIMATING LATTICES , 1988 .

[2]  Ernst-Rüdiger Olderog,et al.  Proof Rules and Transformations Dealing with Fairness , 1983, Sci. Comput. Program..

[3]  David Michael Ritchie Park,et al.  On the Semantics of Fair Parallelism , 1979, Abstract Software Specifications.

[4]  George N. Raney,et al.  Completely distributive complete lattices , 1952 .

[5]  O. Deiser,et al.  On the Development of the Notion of a Cardinal Number , 2010 .

[6]  A. Jung,et al.  Cartesian closed categories of domains , 1989 .

[7]  Qingguo Li,et al.  Characteristics of three-way concept lattices and three-way rough concept lattices , 2018, Knowl. Based Syst..

[8]  Qingguo Li,et al.  All cartesian closed categories of quasicontinuous domains consist of domains , 2015, Theor. Comput. Sci..

[9]  Yiyu Yao,et al.  An analysis of three types of partially-known formal concepts , 2018, Int. J. Mach. Learn. Cybern..

[10]  Qingguo Li,et al.  Weak Approximable Concepts and Completely Algebraic Lattices , 2011, NL-MUA.

[11]  J. Dauben.  Georg Cantor: His Mathematics and Philosophy of the Infinite , 1979 .

[12]  Krzysztof R. Apt,et al.  Countable nondeterminism and random assignment , 1986, JACM.

[13]  Qingguo Li,et al.  On cartesian closed extensions of non-pointed domains , 2017, Theoretical Computer Science.

[14]  S. Maclane,et al.  Categories for the Working Mathematician , 1971 .

[15]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[16]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[17]  G. Grätzer.  On the Family of Certain Subalgebras of a Universal Algebra , 1965 .

[18]  ON CONGRUENCE LATTICES OF m-COMPLETE LATTICES , 1992 .

[19]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[20]  Duoqian Miao,et al.  A study on information granularity in formal concept analysis based on concept-bases , 2016, Knowl. Based Syst..

[21]  K. Hofmann,et al.  Continuous Lattices and Domains , 2003 .

[22]  The category of supercontinuous posets , 2006 .

[23]  Guo-Qiang Zhang,et al.  APPROXIMABLE CONCEPTS, CHU SPACES, AND INFORMATION SYSTEMS , 2006 .

[24]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[25]  Hartmut Ehrig,et al.  Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation , 2006, Fundam. Informaticae.

[26]  Pascal Hitzler,et al.  A Cartesian Closed Category of Approximable Concept Structures , 2004, ICCS.