Approximation Spaces of Type-Free Sets

  • Peter Apostoli
  • Akira Kanda
Conference paper

DOI: 10.1007/3-540-45554-X_11

Volume 2005 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
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

Abstract

We present an approximation space (U;R) which is an infinite (hypercontinuum) solution to the domain equation UC(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 uU, whence (U;R) induces an generalized approximation space (U; c : UU; i : UU); where c(u) = ∪[u]R and i(u) = ∩[u]R.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Peter Apostoli
    • 1
  • Akira Kanda
    • 1
  1. 1.Department of PhilosophyUniversity of TorontoToronto