CoChat

The number of finite topologies

Open access
Kleitman, D., Rothschild, B. · 1970 · Proceedings of the American Mathematical Society

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Abstract

The logarithm (base 2) of the number of distinct topologies on a set of $n$ elements is shown to be asymptotic to ${n^2}/4$ as $n$ goes to infinity.

Overview

Integrity signals

Registry

Crossref · 10.1090/s0002-9939-1970-0253944-9

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 5 references

Cited by

See all 68

Metadata

Authors
Kleitman, D., & Rothschild, B.
Affiliations
University of California, Los Angeles (US)
Venue
Proceedings of the American Mathematical Society
Published
1970-02-01
Volume
25
Issue
2
Pages
276-276
ISSN
0002-9939 (ISSN-L)
OpenAlex
W2086388790
Cited by
68
References
5
Citations by year
2026: 1 · 2025: 2 · 2024: 1 · 2023: 1 · 2022: 1 · 2021: 8 · 2020: 3 · 2019: 3 · 2017: 1 · 2016: 3 · 2015: 3 · 2014: 1 · 2013: 2 · 2012: 2
FWCI
0.00
Type
journal article
Language
en
Open access
Locations
Proceedings of the American Mathematical Society (publishedVersion)
Funders
Air Force Office of Scientific Research
Topics
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
  • Physical Sciences › Mathematics › Geometry and Topology › Advanced Topology and Set Theory
  • Physical Sciences › Mathematics › Statistics and Probability › Probability and Statistical Research
Keywords
finite topology, asymptotic enumeration, logarithmic asymptotics, order theory

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: The number of finite topologies. https://app.cochat.ai/papers/10.1090/s0002-9939-1970-0253944-9
The paper
Kleitman, D., & Rothschild, B. (1970). The number of finite topologies. Proceedings of the American Mathematical Society. https://doi.org/10.1090/s0002-9939-1970-0253944-9

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.