The DOI matches its Crossref record.
On well-quasi-ordering finite trees
Abstract
A new and simple proof is given of the known theorem that, if T1, T2,… is an infinite sequence of finite trees, then there exist i and j such that i < j and Ti is homeomorphic to a subtree of Tj.
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
DERSHOWITZ, N., & JOUANNAUD, J.-P. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50011-1 · Cited by 579
The theory of well-quasi-ordering: A frequently discovered concept
Kruskal, J. B. (1972) · Journal of Combinatorial Theory, Series A · doi:10.1016/0097-3165(72)90063-5 · Cited by 329
Metadata
- Authors
- Nash-Williams, C. S. J. A.
- Venue
- Mathematical Proceedings of the Cambridge Philosophical Society
- Publisher
- Cambridge University Press (CUP)
- Published
- 1963-10
- Volume
- 59
- Issue
- 4
- Pages
- 833-835
- ISSN
- 0305-0041 (ISSN-L)
- 1469-8064
- OpenAlex
- W2163841074
- Cited by
- 314
- References
- 0
- FWCI
- 1.72
- Type
- journal article
- 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: On well-quasi-ordering finite trees. https://app.cochat.ai/papers/10.1017/s0305004100003844
- The paper
- Nash-Williams, C. S. J. A. (1963). On well-quasi-ordering finite trees. Mathematical Proceedings of the Cambridge Philosophical Society. https://doi.org/10.1017/s0305004100003844
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.
