Skip to main content
SpringerLink
Log in

On Rough Equalities and Rough Equivalences of Sets

  • Conference paper
Rough Sets and Current Trends in Computing (RSCTC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5306))

Included in the following conference series:

Abstract

The different types of rough equalities [4,5,6] of sets deal with approximate equalities of sets which may not be equal in the usual sense of classical set theory. In this article, we make further study of the properties of rough equalities. A more general kind of equality of sets (we call it rough equivalence) shall be introduced, which captures equalities of sets at a higher level than rough equalities. Many properties of this new notion and its comparison with rough equalities shall be dealt with. We shall make use of the concepts of rough inclusions of sets in this sequel.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Banerjee, M., Chakraborty, M.K.: Rough Consequence and Rough Algebra in Rough Sets. In: Ziarko, W.P. (ed.) Fuzzy Sets and Knowledge Discovery, Proc. Int. Workshop on Rough Sets and Knowledge Discovery (RSKD 1993), Banf, Canada, pp. 196–207. Springer, London (1994)

    Chapter  Google Scholar 

  2. Bonikowski, Z.: A Certain Conception of the Calculus of Rough sets. Notre Dame Journal of Formal Logic 33, 412–421 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chakraborty, M.K., Banerjee, M.: Rough Dialogue and Implication Lattices. Fundamenta Informetica 75(1-4), 123–139 (2007)

    MathSciNet  MATH  Google Scholar 

  4. Novotny, M., Pawlak, Z.: Characterization of Rough Top equalities and Rough Bottom Equalities. Bullten of Polish Academy of Scieces and Math 33, 91–97 (1985)

    MathSciNet  MATH  Google Scholar 

  5. Novotny, M., Pawlak, Z.: On Rough Equalities. Bulliten of Polish Academy of Sciences and Math. 33, 99–104 (1985)

    MathSciNet  MATH  Google Scholar 

  6. Novotny, M., Pawlak, Z.: Black Box Analysis and Rough Top Equality. Bulliten of Polish Academy of Sciences and Math. 33, 105–113 (1985)

    MathSciNet  MATH  Google Scholar 

  7. Pawlak, Z.: Rough Sets. Int. Jour. Of Info. and Computer Sc. 11, 341–356 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  8. Pawlak, Z.: Rough Sets, Theoretical aspect of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  9. Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Sciences - An International Journal 177(1), 3–27 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Pawlak, Z., Skowron, A.: Rough sets: Some extensions. Information Sciences - An International Journal 177(1), 28–40 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Pawlak, Z., Skowron, A.: Rough sets and Boolean reasoning. Information Sciences - An International Journal 177(1), 41–73 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Tripathy, B.K., Mitra, A.: Topological Properties of Rough Sets and Applications. Communicated to International Journal of Granular Computing, Rough Sets and Intellegent Systems

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing Sciences, V.I.T. University, Vellore, T.N., 632 014, India

    Bala Krushna Tripathy

  2. Department of Computer Science, Berhampur University, Berhampur, Orissa, 760 007, India

    Anirban Mitra

  3. Department of Mathematics, Khallikote College, Berhampur, 760001, Orissa, India

    Jaladhar Ojha

Authors
  1. Bala Krushna Tripathy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anirban Mitra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jaladhar Ojha
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Akron, OH 44325-4003, Akron, USA

    Chien-Chung Chan

  2. Department of Electrical Engineering and Computer Science, University of Kansas, KS 66045, Lawrence, USA

    Jerzy W. Grzymala-Busse

  3. Department of Computer Science, University of Regina,, S4S 0A2, Regina, Saskatchewan, Canada

    Wojciech P. Ziarko

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tripathy, B.K., Mitra, A., Ojha, J. (2008). On Rough Equalities and Rough Equivalences of Sets. In: Chan, CC., Grzymala-Busse, J.W., Ziarko, W.P. (eds) Rough Sets and Current Trends in Computing. RSCTC 2008. Lecture Notes in Computer Science(), vol 5306. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88425-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88425-5_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88423-1

  • Online ISBN: 978-3-540-88425-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation