Lattice–Based Relation Algebras and Their Representability

Abstract

AbstractThe motivation for this paper comes from the following sources. First, one can observe that the two major concepts underlying the methods of reasoning with incomplete information are the concept of degree of truth of a piece of information and the concept of approximation of a set of information items. We shall refer to the theories employing the concept of degree of truth as to theories of fuzziness and to the theories employing the concept of approximation as to theories of roughness (see [6] for a survey). The algebraic structures relevant to these theories are residuated lattices ([7], [12], [13], [16], [17], [18], [22], [23]) and Boolean algebras with operators ([19], [21], [10], [11]), respectively. Residuated lattices provide an arithmetic of degrees of truth and Boolean algebras equipped with the appropriate operators provide a method of reasoning with approximately determined information. Both classes of algebras have a lattice structure as a basis. Second, both theories of fuzziness and theories of roughness develop generalizations of relation algebras to algebras of fuzzy relations [20] and algebras of rough relations ([4], [5], [9]), respectively. In both classes a lattice structure is a basis. Third, not necessarily distributive lattices with modal operators, which can be viewed as most elementary approximation operators, are recently developed in [24] (distributive lattices with operators are considered in [14] and [25]). With this background, our aim is to begin a systematic study of the classes of algebras that have the structure of a (not necessarily distributive) lattice and, moreover, in each class there are some operators added to the lattice which are relevant for binary relations. Our main interest is in developing relational representation theorems for the classes of lattices with operators under consideration. More precisely, we wish to guarantee that each algebra of our classes is isomorphic to an algebra of binary relations on a set. We prove the theorems of that form by suitably extending the Urquhart representation theorem for lattices ([26]) and the representation theorems presented in [1]. The classes defined in the paper are the parts which put together lead to what might be called lattice-based relation algebras. Our view is that these algebras would be the weakest structures relevant for binary relations. All the other algebras of binary relations considered in the literature would then be their signature and/or axiomatic extensions.Throughout the paper we use the same symbol for denoting an algebra or a relational system and their universes.KeywordsBinary RelationDistributive LatticeRepresentation TheoremResiduated LatticeRelation AlgebraThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.