The DOI matches its Crossref record.
Infinite and Finite Sets
Abstract
Infinite sets can behave more strangely than finite ones, at least from the perspective of human beings, whose daily experience is of the finite. The difficulty of dealing with infinite sets was raised by the ancient Greek Zeno in his four “paradoxes;” see [Ang94, Chapter 8] or [Boy91, pp. 74–76] for details. From a modern perspective Zeno’s paradoxes are not paradoxes at all, and can be resolved using tools from real analysis, developed long after Zeno, but this topic is beyond the scope of this text. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Hamiltonian circuits in random graphs
Pósa, L. (1976) · Discrete Mathematics · doi:10.1016/0012-365x(76)90068-6 · Cited by 453
Ajtai, M., Aspnes, J., Naor, M., Rabani, Y., Schulman, L. J., & Waarts, O. (1998) · Journal of Algorithms · doi:10.1006/jagm.1998.0953 · Cited by 47
Metadata
- Authors
- Bloch, E. D.
- Venue
- Proofs and Fundamentals
- Publisher
- Birkhäuser Boston
- Published
- 2003
- Pages
- 203-248
- OpenAlex
- W170265681
- Cited by
- 372
- References
- 0
- FWCI
- 20.79
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Infinite and Finite Sets. https://app.cochat.ai/papers/10.1007/978-1-4612-2130-2_6
- The paper
- Bloch, E. D. (2003). Infinite and Finite Sets. Proofs and Fundamentals. https://doi.org/10.1007/978-1-4612-2130-2_6
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
