Article ID Journal Published Year Pages File Type
394739 Information Sciences 2011 12 Pages PDF
Abstract

In this paper, the concept of intension is used to introduce two types of ordering relations based on information that generates a cover for the universal set. These types of ordering relations are distinct from the well-known ordering relation based on set inclusion. For these ordering relations, we consider the algebraic structures that arise in various types of covers. We show that in the case of a representative cover, the algebraic structure resulting from the lower intension inclusion is a double Stone algebra, while in the case of a reduced cover, it is a Boolean algebra. In addition, the algebraic structure resulting from the upper intension inclusion in the case of a representative cover is a Boolean algebra, and in the case of a reduced cover, the two Boolean algebraic structures from lower and upper intension inclusions are isomorphic.

Related Topics
Physical Sciences and Engineering Computer Science Artificial Intelligence
Authors
, , ,