The DOI matches its Crossref record.
Ordering by Divisibility in Abstract Algebras
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Let à be a set of P-characteristic atoms. Then ¢*ca is a well-quasi relation on Ã.
“Proposition 4.4.11.Let à be a set of P -characteristic atoms.Then ¢ * ca is a well-quasi relation on Ã.”
From Controlling generalization and polyvariance in partial deduction of normal logic programs (1998) · cites this paper as Higman [1952]
Citations
Cited by
Sorted by citations
Controlling generalization and polyvariance in partial deduction of normal logic programs
Leuschel, M., Martens, B., & De Schreye, D. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271525 · Cited by 88
Metadata
- Authors
- Higman, G.
- Affiliations
- University of Manchester (GB)
- Corresponding author
- Higman, Graham
- Venue
- Proceedings of the London Mathematical Society
- Publisher
- Wiley
- Published
- 1952
- Volume
- s3-2
- Issue
- 1
- Pages
- 326-336
- ISSN
- 0024-6115 (ISSN-L)
- OpenAlex
- W2076508310
- Cited by
- 1,078
- References
- 0
- Citations by year
- 2026: 16 · 2025: 9 · 2024: 25 · 2023: 22 · 2022: 38 · 2021: 51 · 2020: 38 · 2019: 36 · 2018: 25 · 2017: 38 · 2016: 37 · 2015: 35 · 2014: 28 · 2013: 42 · 2012: 38
- FWCI
- 3.10
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- Proceedings of the London Mathematical Society (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Algebra and Number Theory › Rings, Modules, and Algebras
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Algebra and Logic
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
- Keywords
- abstract algebra, ordered algebras, lattice theory, divisibility
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