On the public citation graph

A robuster Scott rank

https://doi.org/10.1090/proc/12669
0 signed · 54 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-21875-0_6openalex-snapshot
Effective Categoricity of Injection Structures
inferredcites →https://doi.org/10.1007/bf01669101openalex-snapshot
Autostability of models and Abelian groups
inferredcites →https://doi.org/10.1007/bf01669102openalex-snapshot
Autostability of models
inferredcites →https://doi.org/10.1007/bf02259845openalex-snapshot
Effective choice for relations and reducibilities in classes of constructive and positive models
inferredcites →https://doi.org/10.1007/bfb0090954openalex-snapshot
Two theorems on autostability in p-Groups
inferredcites →https://doi.org/10.1007/s11202-005-0043-9openalex-snapshot
On Automorphic Tuples of Elements in Computable Models
inferredcites →https://doi.org/10.1016/0168-0072(87)90038-8openalex-snapshot
Categoricity in hyperarithmetical degrees
inferredcites →https://doi.org/10.1016/0168-0072(89)90015-8openalex-snapshot
Generic copies of countable structures
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50036-8openalex-snapshot
LOGIC WITH DENUMERABLY LONG FORMULAS AND FINITE STRINGS OF QUANTIFIERS**The author is very much indebted to Carol Karp, E. G. K. Lopez-Escobar, and Czeslaw Ryll-Nardzewski for much stimulating correspondence and many interesting conversations on the topic of this paper.
inferredcites →https://doi.org/10.1016/j.aim.2014.09.022openalex-snapshot
The complexity of computable categoricity
inferredcites →https://doi.org/10.1016/j.apal.2005.10.002openalex-snapshot
Effective categoricity of equivalence structures
inferredcites →https://doi.org/10.1016/j.jalgebra.2006.08.040openalex-snapshot
Subspaces of computable vector spaces
inferredcites →https://doi.org/10.1016/s0001-8708(02)00042-7openalex-snapshot
The computable dimension of ordered abelian groups
inferredcites →https://doi.org/10.1016/s0049-237x(00)x8001-9openalex-snapshot
Computable Structures and the Hyperarithmetical Hierarchy
inferredcites →https://doi.org/10.1017/9781316717196openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1023/a:1025971406116openalex-snapshot
Uniformity in Computable Structure Theory
inferredcites →https://doi.org/10.1090/s0002-9939-1981-0624937-1openalex-snapshot
Recursively Categorical Linear Orderings
inferredcites →https://doi.org/10.1090/s0002-9947-2011-05331-6openalex-snapshot
On the $n$-back-and-forth types of Boolean algebras
inferredcites →https://doi.org/10.1093/logcom/exq048openalex-snapshot
Counting the back-and-forth types
inferredcites →https://doi.org/10.1305/ndjfl/1172787542openalex-snapshot
Bounds on Weak Scattering
inferredcites →https://doi.org/10.1305/ndjfl/1172787543openalex-snapshot
Complexity Ranks of Countable Models
inferredcites →https://doi.org/10.2178/jsl/1107298515openalex-snapshot
Computable categoricity of trees of finite height
inferredcites →https://doi.org/10.2307/2274481openalex-snapshot
Effective model theory vs. recursive model theory
inferredcites →https://doi.org/10.4064/fm-57-3-253-272openalex-snapshot
An interpolation theorem for denumerably long formulas

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-51466-2_9openalex-snapshot
Computable Analysis and Classification Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-34034-5_3openalex-snapshot
Generically Computable Abelian Groups
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_16openalex-snapshot
Effectively Existentially-Atomic Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_18openalex-snapshot
Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey
inferred← citeshttps://doi.org/10.1007/s00153-024-00934-5openalex-snapshot
On categoricity of scattered linear orders of constructive ranks
inferred← citeshttps://doi.org/10.1016/j.aim.2018.03.012openalex-snapshot
Scott ranks of models of a theory
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102855openalex-snapshot
Finitely generated groups are universal among finitely generated structures
inferred← citeshttps://doi.org/10.1016/j.apal.2026.103727openalex-snapshot
Scott complexity of reduced Abelian p-groups
inferred← citeshttps://doi.org/10.1017/bsl.2021.62openalex-snapshot
AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS
inferred← citeshttps://doi.org/10.1017/jsl.2015.30openalex-snapshot
COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS
inferred← citeshttps://doi.org/10.1017/jsl.2016.43openalex-snapshot
DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS
inferred← citeshttps://doi.org/10.1017/jsl.2017.68openalex-snapshot
COMPUTABLE POLISH GROUP ACTIONS
inferred← citeshttps://doi.org/10.1017/jsl.2017.81openalex-snapshot
BOREL FUNCTORS AND INFINITARY INTERPRETATIONS
inferred← citeshttps://doi.org/10.1017/jsl.2020.46openalex-snapshot
THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
inferred← citeshttps://doi.org/10.1017/jsl.2021.4openalex-snapshot
SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
inferred← citeshttps://doi.org/10.1017/jsl.2023.43openalex-snapshot
THE STRUCTURAL COMPLEXITY OF MODELS OF ARITHMETIC
inferred← citeshttps://doi.org/10.1017/jsl.2024.59openalex-snapshot
SCOTT SENTENCE COMPLEXITIES OF LINEAR ORDERINGS
inferred← citeshttps://doi.org/10.1017/jsl.2025.14openalex-snapshot
TORSION-FREE ABELIAN GROUPS OF FINITE RANK AND FIELDS OF FINITE TRANSCENDENCE DEGREE
inferred← citeshttps://doi.org/10.1017/jsl.2026.10186openalex-snapshot
COMPUTABLE $\Pi _2$ SCOTT SENTENCES
inferred← citeshttps://doi.org/10.1017/jsl.2026.10247openalex-snapshot
COMPUTABLE SCOTT SENTENCES AND THE FRIEDMAN–STANLEY EMBEDDING
inferred← citeshttps://doi.org/10.1090/noti1940openalex-snapshot
Martin’s Conjecture: A Classification of the Naturally Occurring Turing Degrees
inferred← citeshttps://doi.org/10.1090/tran/8950openalex-snapshot
The 𝜔-Vaught’s conjecture
inferred← citeshttps://doi.org/10.1090/tran/9695openalex-snapshot
Optimal syntactic definitions of back-and-forth types
inferred← citeshttps://doi.org/10.1093/logcom/exab057openalex-snapshot
Densely computable structures
inferred← citeshttps://doi.org/10.1093/logcom/exaf044openalex-snapshot
Generically computable Abelian groups and isomorphisms
inferred← citeshttps://doi.org/10.1112/blms.70020openalex-snapshot
Scott analysis, linear orders, and almost periodic functions
inferred← citeshttps://doi.org/10.3233/com-180099openalex-snapshot
A first-order theory of Ulm type
inferred← citeshttps://doi.org/10.4064/fm865-6-2020openalex-snapshot
Complexity of Scott sentences
inferred← citeshttps://doi.org/10.48550/arxiv.1506.03066openalex-snapshot
Degrees of categoricity on a cone
inferred← citeshttps://doi.org/10.48550/arxiv.1712.00469openalex-snapshot
Finitely Generated Groups Are Universal
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.