On the public citation graph

Models of arithmetic and closed ideals

https://doi.org/10.2307/2273102
0 signed · 21 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/bfb0066789openalex-snapshot
Countable models of set theories
inferredcites →https://doi.org/10.1090/s0002-9939-1978-0491158-5openalex-snapshot
The additive structure of models of arithmetic
inferredcites →https://doi.org/10.2307/2273426openalex-snapshot
On a problem of MacDowell and Specker
inferredcites →https://doi.org/10.2307/2273454openalex-snapshot
Additive structure in uncountable models for a fixed completion of P
inferredcites →https://doi.org/10.2307/2273590openalex-snapshot
Expansions of models and turing degrees

What points at this work

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

inferred← citeshttps://doi.org/10.1002/malq.200810015openalex-snapshot
Proper and piecewise proper families of reals
inferred← citeshttps://doi.org/10.1007/s00153-015-0431-1openalex-snapshot
Representing Scott sets in algebraic settings
inferred← citeshttps://doi.org/10.1016/j.apal.2008.07.005openalex-snapshot
A standard model of Peano arithmetic with no conservative elementary extension
inferred← citeshttps://doi.org/10.1016/j.apal.2016.12.003openalex-snapshot
Unifying the model theory of first-order and second-order arithmetic via WKL0⁎
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80008-6openalex-snapshot
Chapter 7 Degrees of models
inferred← citeshttps://doi.org/10.1017/cbo9781139028592.007openalex-snapshot
Borel structures: a brief survey
inferred← citeshttps://doi.org/10.1090/s0002-9947-1984-0732105-5openalex-snapshot
Degrees of Recursively Saturated Models
inferred← citeshttps://doi.org/10.1305/ndjfl/1172787547openalex-snapshot
The Borel Complexity of Isomorphism for Theories with Many Types
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/2273957openalex-snapshot
Saturation of homogeneous resplendent models
inferred← citeshttps://doi.org/10.2307/2274174openalex-snapshot
Two theorems on degrees of models of true arithmetic
inferred← citeshttps://doi.org/10.2307/2274950openalex-snapshot
On models of the elementary theory of (Z, +, 1)
inferred← citeshttps://doi.org/10.48550/arxiv.0901.1499openalex-snapshot
Models of PA: Standard Systems without Minimal Ultrafilters
inferred← citeshttps://doi.org/10.48550/arxiv.1407.5612openalex-snapshot
Representing Scott sets in algebraic settings
inferred← citeshttps://doi.org/10.48550/arxiv.1708.00899openalex-snapshot
Cofinal Extensions and Coded Sets
inferred← citeshttps://doi.org/10.48550/arxiv.2007.05885openalex-snapshot
On Non-standard Models of Arithmetic with Uncountable Standard Systems
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.