default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSándor Radeleczki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Dávid Gégény
, Sándor Radeleczki:
On the lattice of fuzzy rough sets. Fuzzy Sets Syst. 488: 108999 (2024)- [j22]Jouni Järvinen, Sándor Radeleczki, Umberto Rivieccio:
Nelson algebras, residuated lattices and rough sets: A survey. J. Appl. Non Class. Logics 34(2-3): 368-428 (2024) - [i9]Jouni Järvinen, Sándor Radeleczki, Umberto Rivieccio:
Nelson algebras, residuated lattices and rough sets: A survey. CoRR abs/2402.02606 (2024) - 2023
- [j21]Jouni Järvinen, Sándor Radeleczki:
Pseudo-Kleene algebras determined by rough sets. Int. J. Approx. Reason. 161: 108991 (2023) - [i8]Jouni Järvinen, Sándor Radeleczki:
Pseudo-Kleene algebras determined by rough sets. CoRR abs/2304.05641 (2023) - 2022
- [j20]Dávid Gégény, Sándor Radeleczki:
Rough L-fuzzy sets: Their representation and related structures. Int. J. Approx. Reason. 142: 1-12 (2022) - [j19]Dávid Gégény, László Kovács, Sándor Radeleczki:
Lattices defined by multigranular rough sets. Int. J. Approx. Reason. 151: 413-429 (2022) - 2021
- [j18]Jouni Järvinen, Sándor Radeleczki:
Defining rough sets as core-support pairs of three-valued functions. Int. J. Approx. Reason. 135: 71-90 (2021) - [j17]Danica Jakubíková-Studenovská, Reinhard Pöschel, Sándor Radeleczki:
The Structure of the Maximal Congruence Lattices of Algebras on a Finite Set. J. Multiple Valued Log. Soft Comput. 36(4-5): 299-320 (2021) - [j16]Kalle Kaarli, Sándor Radeleczki:
Ordered Relations, Concept Lattices and Self-bonds. J. Multiple Valued Log. Soft Comput. 36(4-5): 321-336 (2021) - 2020
- [j15]Eszter K. Horváth, Sándor Radeleczki, Branimir Seselja, Andreja Tepavcevic:
Cuts of poset-valued functions in the framework of residuated maps. Fuzzy Sets Syst. 397: 28-40 (2020) - [j14]Jouni Järvinen, Sándor Radeleczki:
The Structure of Multigranular Rough Sets. Fundam. Informaticae 176(1): 17-41 (2020) - [j13]Dávid Gégény, László Kovács, Sándor Radeleczki:
Notes on the lattice of fuzzy rough sets with crisp reference sets. Int. J. Approx. Reason. 126: 124-132 (2020) - [i7]Jouni Järvinen, Sándor Radeleczki:
The structure of multigranular rough sets. CoRR abs/2002.05238 (2020) - [i6]Mani A, Sándor Radeleczki:
Algebraic Approach to Directed Rough Sets. CoRR abs/2004.12171 (2020) - [i5]Jouni Järvinen, Sándor Radeleczki:
Defining rough sets as core-support pairs of three-valued functions. CoRR abs/2011.03461 (2020)
2010 – 2019
- 2019
- [j12]Jouni Järvinen, László Kovács, Sándor Radeleczki:
Defining rough sets using tolerances compatible with an equivalence. Inf. Sci. 496: 264-283 (2019) - [j11]Stephan Foldes, Douglas Stott Parker, Sándor Radeleczki:
The Meet Operation in the Imbalance Lattice of Maximal Instantaneous Codes: Alternative Proof of Existence. IEEE Trans. Inf. Theory 65(12): 8207-8212 (2019) - [c2]Jouni Järvinen, László Kovács, Sándor Radeleczki:
Rough Sets Defined by Multiple Relations. IJCRS 2019: 40-51 - [c1]Dávid Gégény, Imre Piller, Sándor Radeleczki, Laura Veres:
Approximations Induced by Tolerance Relations. IJCRS 2019: 265-279 - 2018
- [i4]Jouni Järvinen, László Kovács, Sándor Radeleczki:
Defining rough sets using tolerances compatible with an equivalence. CoRR abs/1811.09609 (2018) - 2017
- [j10]Wojciech Dzik, Sándor Radeleczki:
Direct Product of ℓ-Algebras and Unification: An Application to Residuated Lattices. J. Multiple Valued Log. Soft Comput. 28(2-3): 189-215 (2017) - 2016
- [j9]Melvin F. Janowitz, Sándor Radeleczki:
Aggregation on a Finite Lattice. Order 33(3): 371-388 (2016) - [j8]Ivan Chajda, Sándor Radeleczki:
Involutive right-residuated l-groupoids. Soft Comput. 20(1): 119-131 (2016) - [i3]Jouni Järvinen, Sándor Radeleczki:
Representing regular Kleene algebras by tolerance-based rough sets. CoRR abs/1610.09847 (2016) - 2015
- [j7]Jouni Järvinen, Sándor Radeleczki:
Tolerances Induced by Irredundant Coverings. Fundam. Informaticae 137(3): 341-353 (2015) - 2014
- [j6]Jouni Järvinen, Sándor Radeleczki:
Monteiro Spaces and Rough Sets Determined by Quasiorder Relations: Models for Nelson algebras. Fundam. Informaticae 131(2): 205-215 (2014) - [j5]Jouni Järvinen, Sándor Radeleczki:
Rough sets determined by tolerances. Int. J. Approx. Reason. 55(6): 1419-1438 (2014) - [i2]Jouni Järvinen, Sándor Radeleczki:
Tolerances induced by irredundant coverings. CoRR abs/1404.5184 (2014) - 2013
- [j4]Jouni Järvinen, Piero Pagliani, Sándor Radeleczki:
Information Completeness in Nelson Algebras of Rough Sets Induced by Quasiorders. Stud Logica 101(5): 1073-1092 (2013) - 2012
- [i1]Stephan Foldes, Eszter K. Horváth, Sándor Radeleczki, Tamás Waldhauser:
A general framework for island systems. CoRR abs/1210.1741 (2012) - 2011
- [j3]Danica Jakubíková-Studenovská, Reinhard Pöschel, Sándor Radeleczki:
The Lattice of Compatible Quasiorders of Acyclic Monounary Algebras. Order 28(3): 481-497 (2011)
2000 – 2009
- 2009
- [j2]Jouni Järvinen, Sándor Radeleczki, Laura Veres:
Rough Sets Determined by Quasiorders. Order 26(4): 337-355 (2009) - 2005
- [j1]Sándor Radeleczki, Jenö Szigeti:
Linear Orders on General Algebras. Order 22(1): 41-62 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
