4 papers
On Boolean sublattices of finite partition lattices
Foldes Stephan, Sandor Radeleczki
We investigate maximal Boolean sublattices of the partition lattice Part(U) of a finite universe U. First, any largest size Boolean sublattice of Part(U) can be formed using all pa…
Kleene and Stone algebras of rough sets induced by reflexive relations
Jouni Järvinen, Sándor Radeleczki
We consider Kleene and Stone algebras defined on the completion DM(RS) of the ordered set of rough sets induced by a reflexive relation. We focus on cases where the completion form…
Generalized quasiorders: constructions and characterizations
D. JakubÃková-Studenovská, R. Pöschel, S. Radeleczki
Quasiorders have the property that an operation preserves if and only if each (unary) translation obtained from is an endomorp…
The structure of rough sets defined by reflexive relations
Jouni Järvinen, Sándor Radeleczki
For several types of information relations, the induced rough sets system RS does not form a lattice but only a partially ordered set. However, by studying its Dedekind-MacNeille c…