Chu Spaces, Concept Lattices, and Domains

Chu Spaces, Concept Lattices, and Domains

This paper serves to bring three independent but important areas of computer science to a common meeting point: Formal Concept Analysis (FCA), Chu Spaces, and Domain Theory (DT). Each area is given a perspective or reformulation that is conducive to the flow of ideas and to the exploration of cross-disciplinary connections. Among other results, we show that the notion of states in Scott’s infor...

Rough concept lattices and domains

Rough Set Theory (RST) and Domain Theory (DT) are two independent but important areas of computer science. In this paper, they have a meeting point from the angle of knowledge representation and reasoning (KRR). First, we give the simplified relationship between two existing rough concept lattices and complete lattices via Galois connections (, ♦). Second, we show that for a formal context, if ...

Chu Spaces

Nabla Algebras and Chu Spaces

This paper is a study into some properties and applications of Moss’ coalgebraic or ‘cover’ modality ∇. First we present two axiomatizations of this operator, and we prove these axiomatizations to be sound and complete with respect to basic modal and positive modal logic, respectively. More precisely, we introduce the notions of a modal ∇-algebra and of a positive modal ∇-algebra. We establish ...

Bifinite Chu Spaces

This paper studies colimits of sequences of finite Chu spaces and their ramifications. Besides generic Chu spaces, we consider extensional and biextensional variants. In the corresponding categories we first characterize the monics and then the existence (or the lack thereof) of the desired colimits. In each case, we provide a characterization of the finite objects in terms of monomorphisms/inj...