activity
20082026
most citedRough sets determined by tolerances

39 citations · 182 across the 24 of their papers we have counts for

collaborators
Showing math.RAShow all

11 papers · 1 filter

math.RA2026

Characterising regular double Stone and pseudocomplemented Kleene algebras in completions 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 the cases where the completion…

math.RA2024

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…

math.RA2023

Generalized Quasiorders and the Galois Connection End-gQuord

Danica Jakubíková-Studenovská, Reinhard Pöschel, Sándor Radeleczki

Equivalence relations or, more general, quasiorders (i.e., reflexive and transitive binary relations) have the property that an -ary operation preserves , i.e., i…

math.RA2023★ 5 cited

Pseudo-Kleene algebras determined by rough sets

Jouni Järvinen, Sándor Radeleczki

We study the pseudo-Kleene algebras of the Dedekind-MacNeille completion of the ordered set of rough set determined by a reflexive relation. We characterize the cases when PBZ and…

math.RA2020★ 1 cited

Defining rough sets as core-support pairs of three-valued functions

Jouni Järvinen, Sándor Radeleczki

We answer the question what properties a collection of three-valued functions on a set must fulfill so that there exists a quasiorder on such that the…

math.RA2020★ 2 cited

The structure of multigranular rough sets

Jouni Järvinen, Sándor Radeleczki

We study multigranulation spaces of two equivalences. The lattice-theoretical properties of so-called "optimistic" and "pessimistic" multigranular approximation systems are given.…

math.RA2019

G. Czédli's tolerance factor lattice construction, and weak ordered relations

Sándor Radeleczki

The main results of the paper points out the connection between the weak ordered relations and factor lattices defined by tolerances. It is proved that for any tolerance of a l…

math.RA2014★ 3 cited

Tolerances induced by irredundant coverings

Jouni Järvinen, Sándor Radeleczki

In this paper, we consider tolerances induced by irredundant coverings. Each tolerance on determines a quasiorder by setting if and only if $R…

math.RA2013★ 39 cited

Rough sets determined by tolerances

Jouni Järvinen, Sándor Radeleczki

We show that for any tolerance on , the ordered sets of lower and upper rough approximations determined by form ortholattices. These ortholattices are completely distrib…

math.RA2012★ 30 cited

Information completeness in Nelson algebras of rough sets induced by quasiorders

Jouni Järvinen, Piero Pagliani, Sándor Radeleczki

In this paper, we give an algebraic completeness theorem for constructive logic with strong negation in terms of finite rough set-based Nelson algebras determined by quasiorders. W…

math.RA2008★ 33 cited

Rough Sets Determined by Quasiorders

Jouni Järvinen, Sándor Radeleczki, Laura Veres

In this paper, the ordered set of rough sets determined by a quasiorder relation is investigated. We prove that this ordered set is a complete, completely distributive lattice.…