Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apostoli,P.,Kanda,A., Parts of the Continuum: towards a modern ontology of science,forthcoming in the Poznan Studies in the Philosophy of Science and the Humanities (ed.Leszek Nowak).
Bell J. L., “TypeReducingCorrespondencesandWell-Orderings: Frege’s andZermelo’s Constructions Re-examined,” J. of Symbolic Logic, 60, (1995).
Bell J. L., “The Set as One and the Set as Many,” J. of Symbolic Logic, (1999).
Cattaneo, G., “Abstract Approximation Spaces for Rough Theories,” Rough Sets in Knowledge Discovery:Methodology and Applications, eds. L. Polkowski, A. Skowron. Studies in Fuzziness and Soft Computing. Ed.: J. Kacprzyk. Vol. 18, Springer (1998).
Cocchiarella, N., “Wither Russell’s Paradox of Predication?”, Nous, (1972).
Lewis, D., “Counterpart Theory and QuantifiedModal Logic,” J. of Philosophy 65 (1968), pp 113–26. Reprinted inMichael J. Loux [ed.] The Possible and the Actual (1979; Cornell U.P.)
Lin, T. Y., “Neighborhood Systems: A Qualitative Theory for Fuzzy and Rough Sets,” Advances in Machine Intelligence and Soft Computing,Volume IV. Ed. Paul Wang, (1997) 132–155.
Lin, T. Y., “A Set Theory for Soft Computing. A unified View of Fuzzy Sets via Neighborhoods,” Proceedingsof 1996 IEEE InternationalConferenceon Fuzzy Systems,NewOrleans, Louisiana, September 8-11, 1996, 1140–1146.
Pawlak Z., “Rough Sets,” International Journal of Computer and Information Sciences, 11, 341–350, (1982).
Pawlak Z., “Rough Set Elements,” Rough Sets in Knowledge Discovery:Methodology and Applications, eds. L. Polkowski, A. Skowron. Studies in Fuzziness and Soft Computing. Ed.: J. Kacprzyk. Vol. 18, Springer (1998).
Plotkin G., “A Power Domain Construction,” SIAM Journal on Computing, 5, 452–487, (1976).
Wiweger, Antoni, “On TopologicalRough Sets,” Bulletin of the PolishAcademy of Sciences, Mathematics, Vol 37, No. 16, (1989).
Yao, Y. Y., “Constructive and Algebraic Methods of the Theory of Rough Sets,” Journal of Information Sciences 109, 21–47 (1998).
Yao, Y. Y., “On Generalizing Pawlak Approximation Operators,” eds. L. Polkowski and A. Skowron, RSCTC'98, LNAI 1414, pp. 289–307, (1998).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Apostoli, P., Kanda, A. (2001). Approximation Spaces of Type-Free Sets. In: Ziarko, W., Yao, Y. (eds) Rough Sets and Current Trends in Computing. RSCTC 2000. Lecture Notes in Computer Science(), vol 2005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45554-X_11
Download citation
DOI: https://doi.org/10.1007/3-540-45554-X_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43074-2
Online ISBN: 978-3-540-45554-7
eBook Packages: Springer Book Archive