TOPICS
Search

Countable Set


A countable set is a set that is either finite or denumerable. However, some authors (e.g., Ciesielski 1997, p. 64) use the definition "equipollent to the finite ordinals," commonly used to define a denumerable set, to define a countable set.


See also

Aleph-0, Aleph-1, Countably Infinite, Denumerable Set, Finite, Infinite, Uncountably Infinite

Explore with Wolfram|Alpha

References

Ciesielski, K. Set Theory for the Working Mathematician. Cambridge, England: Cambridge University Press, 1997.Croft, H. T.; Falconer, K. J.; and Guy, R. K. Unsolved Problems in Geometry. New York: Springer-Verlag, p. 2, 1991.

Referenced on Wolfram|Alpha

Countable Set

Cite this as:

Weisstein, Eric W. "Countable Set." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/CountableSet.html

Subject classifications

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy