On the public citation graph

Expansions of models and turing degrees

https://doi.org/10.2307/2273590
0 signed · 28 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-662-21755-9openalex-snapshot
Degrees of Unsolvability
inferredcites →https://doi.org/10.1016/s0049-237x(08)71108-xopenalex-snapshot
Cornbinatorics
inferredcites →https://doi.org/10.1016/s0049-237x(08)71117-0openalex-snapshot
Degrees of Unsolvability: A Survey of Results
inferredcites →https://doi.org/10.1090/pspum/005/0141595openalex-snapshot
Algebras of sets binumerable in complete extensions of arithmetic
inferredcites →https://doi.org/10.1090/s0002-9939-1978-0491158-5openalex-snapshot
The additive structure of models of arithmetic
inferredcites →https://doi.org/10.1090/s0002-9947-1972-0316227-0openalex-snapshot
Π⁰₁ classes and degrees of theories
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2307/2271956openalex-snapshot
Sets which do not have subsets of every higher degree
inferredcites →https://doi.org/10.2307/2272817openalex-snapshot
Toward model theory through recursive saturation
inferredcites →https://doi.org/10.2307/2273426openalex-snapshot
On a problem of MacDowell and Specker
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
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.1002/1521-3870(200202)48:2<245::aid-malq245>3.0.co;2-7openalex-snapshot
Bounded Scott Set Saturation
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_1openalex-snapshot
The Work of Anil Nerode: A Retrospective
inferred← citeshttps://doi.org/10.1007/s00153-015-0431-1openalex-snapshot
Representing Scott sets in algebraic settings
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90066-7openalex-snapshot
Which set existence axioms are needed to prove the separable Hahn-Banach theorem?
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/s0049-237x(09)70158-2openalex-snapshot
Friedman's Research on Subsystems of Second Order Arithmetic
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80002-5openalex-snapshot
Chapter 1 Pure computable model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80012-8openalex-snapshot
Chapter 11 A bibliography of recursive algebra and recursive model theory
inferred← citeshttps://doi.org/10.1017/s0022481200043619openalex-snapshot
JSL volume 47 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.1305/ndjfl/1172787547openalex-snapshot
The Borel Complexity of Isomorphism for Theories with Many Types
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/2273670openalex-snapshot
Degrees of types and independent sequences
inferred← citeshttps://doi.org/10.2307/2274652openalex-snapshot
The spectrum of resplendency
inferred← citeshttps://doi.org/10.48550/arxiv.1407.5612openalex-snapshot
Representing Scott sets in algebraic settings
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.