sL-approximation spaces capture sL-domains

Abstract In this paper, by means of upper approximation operators in rough set theory, we study representations for sL-domains and its special subclasses. We introduce the concepts of sL-approximation spaces, L-approximation spaces, and bc-approximation spaces, which are special types of CF-approximation spaces. We prove that the collection of CF-closed sets in an sL-approximation space (resp., an L-approximation space, a bc-approximation space) ordered by set-theoretic inclusion is an sL-domain (resp., an L-domain, a bc-domain); conversely, every sL-domain (resp., L-domain, bc-domain) is order-isomorphic to the collection of CF-closed sets of an sL-approximation space (resp., an L-approximation space, a bc-approximation space). Consequently, we establish an equivalence between the category of sL-domains (resp., L-domains) with Scott continuous mappings and that of sL-approximation spaces (resp., L-approximation spaces) with CF-approximable relations.

Authors

Institutions

Publication Details

Journal
Mathematical Structures in Computer Science
Published
2025-01-01
DOI
https://doi.org/10.1017/s0960129525000052
Primary Topic
Rough Sets and Fuzzy Logic
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

sL-approximation spaces capture sL-domains

Guanzhen Wu, Wei Yao, Luoshan Xu
Mathematical Structures in Computer Science
Rough Sets and Fuzzy Logic
article

sL-approximation spaces capture sL-domains

Guanzhen Wu, Wei Yao, Luoshan Xu
article en

Abstract

Abstract In this paper, by means of upper approximation operators in rough set theory, we study representations for sL-domains and its special subclasses. We introduce the concepts of sL-approximation spaces, L-approximation spaces, and bc-approximation spaces, which are special types of CF-approximation spaces. We prove that the collection of CF-closed sets in an sL-approximation space (resp., an L-approximation space, a bc-approximation space) ordered by set-theoretic inclusion is an sL-domain (resp., an L-domain, a bc-domain); conversely, every sL-domain (resp., L-domain, bc-domain) is order-isomorphic to the collection of CF-closed sets of an sL-approximation space (resp., an L-approximation space, a bc-approximation space). Consequently, we establish an equivalence between the category of sL-domains (resp., L-domains) with Scott continuous mappings and that of sL-approximation spaces (resp., L-approximation spaces) with CF-approximable relations.

Mathematical Structures in Computer ScienceVol. 35
Nanjing University of Information Science and Technology (CN), Yangzhou University (CN)
Openalex Percentile: Top 92%
Rough Sets and Fuzzy Logic
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

sL-approximation spaces capture sL-domains — Guanzhen Wu, Wei Yao, et al. · Mathematical Structures in Computer Science (2025) | TGRS Research Map | TGRS