On the public citation graph
On a problem of MacDowell and Specker
0 signed · 18 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0016-0032(60)90676-1openalex-snapshot
An introduction to the theory of numbers
inferredcites →https://doi.org/10.1017/s0022481200051604openalex-snapshot
An introduction to recursively saturated and resplendent models
inferredcites →https://doi.org/10.1090/s0002-9939-1978-0491158-5openalex-snapshot
The additive structure of models of arithmetic
inferredcites →https://doi.org/10.1201/b13782-17openalex-snapshot
An Introduction to Mathematical Logic
inferredcites →https://doi.org/10.2307/2311171openalex-snapshot
An Introduction to the Theory of Numbers.
inferredcites →https://doi.org/10.4064/fm-41-2-203-271openalex-snapshot
Elementary properties of Abelian groups
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bfb0082233openalex-snapshot
Countable or ω1-like models of Presburger's arithmetic
inferred← citeshttps://doi.org/10.1007/s001530000060openalex-snapshot
Computability in structures representing a Scott set
inferred← citeshttps://doi.org/10.1017/s0022481200031285openalex-snapshot
ω1-like recursively saturated models of Presburger's arithmetic
inferred← citeshttps://doi.org/10.1017/s0022481200046338openalex-snapshot
JSL volume 45 issue 4 Cover and Back matter and Errata
inferred← citeshttps://doi.org/10.1090/s0002-9947-1984-0732105-5openalex-snapshot
Degrees of Recursively Saturated Models
inferred← citeshttps://doi.org/10.2307/2273102openalex-snapshot
Models of arithmetic and closed ideals
inferred← citeshttps://doi.org/10.2307/2273454openalex-snapshot
Additive structure in uncountable models for a fixed completion of P
inferred← citeshttps://doi.org/10.2307/2273590openalex-snapshot
Expansions of models and turing degrees
inferred← citeshttps://doi.org/10.48550/arxiv.1112.4062openalex-snapshot
Real closed exponential fields
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.