Skip to main content

The Paradox of the Heap of Grains in Respect to Roughness, Fuzziness and Negligibility

  • Conference paper
  • First Online:
Rough Sets and Current Trends in Computing (RSCTC 1998)

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

Included in the following conference series:

Abstract

In a first step, roughness and fuzziness fail to account for the type of grad-uality (vagueness) involved in the concept of a heap, as it is conceived in the famous Eubulides’ paradox. One can partially bridge this gap by means of tolerance rough sets. Even in this case, a non-concordance persists between the empirical finiteness and the theoretical infinity of a heap. Another way to approach this problem could be via negligibility (be it cardinal, measure-theoretic or topological)

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

Access this chapter

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. Marcus, Solomon. Tolerance rough sets, Cech topology, learning processes. Bulletin of the Polish Acad. Sci. Technical Sci. 42(1994)3, 471–487.

    MATH  Google Scholar 

  2. Mares, Milan. Fuzzy zero, algebraic equivalence: yes or not? Kybernetika 32(1996)4, 343–351.

    MATH  MathSciNet  Google Scholar 

  3. Nieminen, J. Rough tolerance equality. Fundam. Inf. 11(1988), 289–296.

    MATH  MathSciNet  Google Scholar 

  4. Pawlak, Zdzislaw. Vagueness-a rough set view. Lecture Notes in Computer Science 1261 (J. Mycielski, G. Rozenberg, A. Salomaa, eds.) “Structures in Logic and Computer Science-A Selection of Essays in Honor of A. Ehrenfeucht. Berlin-New York: Springer, 1997, 106–117.

    Google Scholar 

  5. Polkowski, L., A. Skowron, J. Zytkov. Tolerance based rough sets, in “Soft Computing (T.Y. Lin, A.M. Wildberger, eds.), “Simulations Councils”, San Diego, 1995, 55–58.

    Google Scholar 

  6. Pomykala, J.A. On definability in the non-deterministic information systems. Bulletin of the Polish Acad. Sci., Math. 36(1988), 193–210.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marcus, S. (1998). The Paradox of the Heap of Grains in Respect to Roughness, Fuzziness and Negligibility. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-69115-4_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64655-6

  • Online ISBN: 978-3-540-69115-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics