In this paper, the ordered set of rough sets determined by a quasiorder relation R is investigated. We prove that this ordered set is a complete, completely distributive lattice, whenever the partially ordered set of the equivalence classes of R∩R−1 does not contain infinite ascending chains. We show that on this lattice can be defined three different kinds of complementation operations, and we...

The Lindenbaum algebra generated by the Abramsky ni-tary logic is a distributive lattice dual to an SFP-domain obtained as a solution of a recursive domain equation. We extend Abramsky's result by proving that the Lindenbaum algebra generated by the innnitary logic is a completely distributive lattice dual to the same SFP-domain. As a consequence soundness and completeness of the innnitary logi...

In this paper, the ordered set of rough sets determined by a quasiorder relation R is investigated. We prove that this ordered set is a complete, completely distributive lattice, whenever the partially ordered set of the equivalence classes of R∩R does not contain infinite ascending chains. We show that on this lattice can be defined three different kinds of complementation operations, and we d...

In this paper, the ordered set of rough sets determined by a quasiorder relation R is investigated. We prove that this ordered set is a complete, completely distributive lattice. We show that on this lattice can be defined three different kinds of complementation operations, and we describe its completely join-irreducible elements. We also characterize the case in which this lattice is a Stone ...

It is well known that the lattice $${{\,\mathrm{Id_c}\,}}{G}$$ of all principal $$\ell $$ -ideals any Abelian -group G a completely normal distributive 0-lattice; yet not every 0-lattice homomorphic image some , via counterexample cardinality $$\aleph _2$$ . We prove with at most _1$$ elements By Stone duality, this means generalized spectral space compact open sets homeomorphic to subspace -sp...

Rough sets deal with the vagueness and granularity in information systems. Reference[3] discusses rough approximations on a complete completely distributive lattice(CCD lattice for short) and brings generalizations of rough sets into a unified framework. This paper is devoted to the discussion of the relationship between approximations and topologies on a CCD lattice. It is proved that the set ...

In this paper, concepts of strongly way below relations, completely precontinuous posets, coprimes and Heyting posets are introduced. The main results are: (1) The strongly way below relations of completely precontinuous posets have the interpolation property; (2) A poset P is a completely precontinuous poset iff its normal completion is a completely distributive lattice; (3) An ω-chain complet...

In this paper, we introduce the concept of the generalized topological molecular lattices as a generalization of Wang's topological molecular lattices,  topological spaces, fuzzy topological spaces, L-fuzzy topological spaces and soft topological spaces. Topological molecular lattices were defined by closed elements, but in this new structure we present the concept of the open elements and defi...