On the public citation graph

Two theorems on degrees of models of true arithmetic

https://doi.org/10.2307/2274174
0 signed · 31 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.1002/malq.19660120125openalex-snapshot
Classes of Recursively Enumerable Sets and Degrees of Unsolvability
inferredcites →https://doi.org/10.1007/bfb0067135openalex-snapshot
Degrees of Unsolvability: Structure and Theory
inferredcites →https://doi.org/10.1016/0003-4843(76)90023-1openalex-snapshot
A degree-theoretic definition of the ramified analytical hierarchy
inferredcites →https://doi.org/10.1016/s0049-237x(08)71117-0openalex-snapshot
Degrees of Unsolvability: A Survey of Results
inferredcites →https://doi.org/10.1016/s0049-237x(08)71887-1openalex-snapshot
Degrees of Models of True Arithmetic
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7131-2openalex-snapshot
Degrees of Unsolvability
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/pspum/013.1/0276079openalex-snapshot
Forcing with perfect closed sets
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/1970028openalex-snapshot
On Degrees of Unsolvability
inferredcites →https://doi.org/10.2307/1970214openalex-snapshot
On the Degrees Less than 0 �
inferredcites →https://doi.org/10.2307/1996261openalex-snapshot
∏ 0 1 Classes and Degrees of Theories
inferredcites →https://doi.org/10.2307/2270699openalex-snapshot
A note on the hyperarithmetical hierarchy
inferredcites →https://doi.org/10.2307/2271359openalex-snapshot
Uniformly introreducible sets
inferredcites →https://doi.org/10.2307/2273102openalex-snapshot
Models of arithmetic and closed ideals
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.2307/2964680openalex-snapshot
Degrees of models
inferredcites →https://doi.org/10.4153/cjm-1972-113-9openalex-snapshot
Degrees in Which the Recursive Sets are Uniformly Recursive

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bfb0082238openalex-snapshot
Degrees of models with prescribed Scott set
inferred← citeshttps://doi.org/10.1016/0168-0072(85)90001-6openalex-snapshot
Upper bounds for the arithmetical degrees
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)80008-6openalex-snapshot
Chapter 7 Degrees of models
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.1016/s0049-237x(98)80046-3openalex-snapshot
Chapter 13 Π10 classes in mathematics
inferred← citeshttps://doi.org/10.1090/noti2436openalex-snapshot
Calibrating Computational Complexity via Definability: The Work of Julia F. Knight
inferred← citeshttps://doi.org/10.1090/s0002-9947-1984-0732105-5openalex-snapshot
Degrees of Recursively Saturated Models
inferred← citeshttps://doi.org/10.1305/ndjfl/1093635587openalex-snapshot
Enumerations of Turing ideals with applications.
inferred← citeshttps://doi.org/10.2178/bsl/1182353917openalex-snapshot
Computability-Theoretic Complexity of Countable Structures
inferred← citeshttps://doi.org/10.2307/2275404openalex-snapshot
Minimal upper bounds for arithmetical degrees
inferred← citeshttps://doi.org/10.2307/2275810openalex-snapshot
Minimal complementation below uniform upper bounds for the arithmetical degrees
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.