Type reducing correspondences and well-orderings: Frege's and Zermelo's constructions re-examined
Journal of Symbolic Logic
On Generalizing Pawlak Approximation Operators
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Constructive and algebraic methods of the theory of rough sets
Information Sciences: an International Journal
Proximity spaces of exact sets
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
First steps towards computably-infinite information systems
Transactions on Rough Sets II
| Hi-index | 0.00 |
We present an approximation space (U, R) which is an infinite (hypercontinuum) solution to the domain equation U ≅ C(R), the family of elementary subsets of U. Thus U is a universe of type-free sets and R is the relation of indiscernibility with respect to membership in other type-free sets. R thus associates a family [u]R of elementary subsets with u ∈ U, whence (U, R) induces an generalized approximation space (U, c: U → U; i : U → U); where c(u) = ∪[u]R and i(u) = ∩[u]R.