On the public citation graph

Transfinite extensions of Friedberg's completeness criterion

0 signed · 22 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.1090/s0002-9947-1967-0219421-0openalex-snapshot
The Forcing Method and the Upper Semilattice of Hyperdegrees
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.2307/2964177openalex-snapshot
A criterion for completeness of degrees of unsolvability
inferredcites →https://doi.org/10.2307/2964544openalex-snapshot
Incompleteness along paths in progressions of theories
inferredcites →https://doi.org/10.4064/fm-56-3-325-345openalex-snapshot
Some applications of the notions of forcing and generic sets

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf02007145openalex-snapshot
The arithmetic and Turing degrees are not elementarily equivalent
inferred← citeshttps://doi.org/10.1016/0168-0072(88)90034-6openalex-snapshot
A non-inversion theorem for the jump operator
inferred← citeshttps://doi.org/10.1016/j.apal.2015.08.001openalex-snapshot
Measuring complexities of classes of structures
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80047-5openalex-snapshot
Chapter 14 Computability theory and linear orderings
inferred← citeshttps://doi.org/10.1017/9781316718254.005openalex-snapshot
Definability and global degree theory
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.005openalex-snapshot
Computability theory, algorithmic randomness and Turing's anticipation
inferred← citeshttps://doi.org/10.1090/conm/257/04040openalex-snapshot
Natural definability in degree structures
inferred← citeshttps://doi.org/10.1090/s0002-9939-2014-12283-0openalex-snapshot
Spectra of theories and structures
inferred← citeshttps://doi.org/10.1090/s0002-9947-1983-0682720-1openalex-snapshot
Pseudo Jump Operators. I: The R. E. Case
inferred← citeshttps://doi.org/10.1090/s0002-9947-1990-0955487-0openalex-snapshot
Jumps of orderings
inferred← citeshttps://doi.org/10.1090/tran/7621openalex-snapshot
On the structure of the Wadge degrees of bqo-valued Borel functions
inferred← citeshttps://doi.org/10.1142/9789819806584_0005openalex-snapshot
Turing Degrees of Hyperjumps
inferred← citeshttps://doi.org/10.2307/2001255openalex-snapshot
Jumps of Orderings
inferred← citeshttps://doi.org/10.2307/2273465openalex-snapshot
Forcing and reductibilities. II. Forcing in fragments of analysis
inferred← citeshttps://doi.org/10.2307/2273547openalex-snapshot
Forcing and reducibilities
inferred← citeshttps://doi.org/10.2307/2274273openalex-snapshot
Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
inferred← citeshttps://doi.org/10.2307/2275695openalex-snapshot
Boolean algebras, Stone spaces, and the iterated Turing jump
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.