On the public citation graph

Post's Programme for the Ershov Hierarchy

https://doi.org/10.1093/logcom/exm032
0 signed · 36 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.1006/inco.1995.1099openalex-snapshot
Recursion Theoretic Properties of Frequency Computation and Bounded Queries
inferredcites →https://doi.org/10.1007/11750321_65openalex-snapshot
Immunity Properties and the n-C.E. Hierarchy
inferredcites →https://doi.org/10.1007/bf02937291openalex-snapshot
Weak density and cupping in the d-r.e. degrees
inferredcites →https://doi.org/10.1007/s00153-005-0288-9openalex-snapshot
Hypersimplicity and semicomputability in the weak truth table degrees
inferredcites →https://doi.org/10.1007/s001530100111openalex-snapshot
Isolation and the high/low hierarchy
inferredcites →https://doi.org/10.1016/j.apal.2007.11.002openalex-snapshot
Lowness properties and approximations of the jump
inferredcites →https://doi.org/10.1016/s0049-237x(99)x8037-2openalex-snapshot
Classical Recursion Theory
inferredcites →https://doi.org/10.1016/s0168-0072(96)00031-0openalex-snapshot
A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
inferredcites →https://doi.org/10.1017/s0022481200051252openalex-snapshot
Degrees of classes of RE sets
inferredcites →https://doi.org/10.1090/s0002-9904-1944-08111-1openalex-snapshot
Recursively enumerable sets of positive integers and their decision problems
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1090/s0002-9939-1968-0230618-2openalex-snapshot
Recursive Functions of One Variable
inferredcites →https://doi.org/10.1090/s0002-9947-1968-0227009-1openalex-snapshot
On the Lattice of Recursively Enumerable Sets
inferredcites →https://doi.org/10.1090/s0002-9947-1974-0469729-2openalex-snapshot
Deficiency Sets and Bounded Information Reducibilities
inferredcites →https://doi.org/10.1090/s0002-9947-1987-0879565-xopenalex-snapshot
T-Degrees, Jump Classes, and Strong Reducibilities
inferredcites →https://doi.org/10.1142/9789812564894_0013openalex-snapshot
ENUMERABLE SETS ARE DIOPHANTINE
inferredcites →https://doi.org/10.1142/9789812812940_0009openalex-snapshot
DECIDABILITY AND UNDECIDABILITY IN THE ENUMERABLE TURING DEGREES
inferredcites →https://doi.org/10.1305/ndjfl/1163775443openalex-snapshot
The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees
inferredcites →https://doi.org/10.1515/9783110807486.81openalex-snapshot
Weak recursive degrees and a problem of Spector
inferredcites →https://doi.org/10.2178/jsl/1107298519openalex-snapshot
On the definable ideal generated by nonbounding c.e. degrees
inferredcites →https://doi.org/10.2307/2271305openalex-snapshot
A theorem on hyperhypersimple sets
inferredcites →https://doi.org/10.2307/2271654openalex-snapshot
Recursion, metarecursion, and inclusion
inferredcites →https://doi.org/10.2307/2275639openalex-snapshot
Contiguity and distributivity in the enumerable Turing degrees
inferredcites →https://doi.org/10.2307/2695042openalex-snapshot
On the structures inside truth-table degrees

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_51openalex-snapshot
The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_28openalex-snapshot
Index Sets and Universal Numberings
inferred← citeshttps://doi.org/10.1016/j.apal.2009.06.007openalex-snapshot
Extending and interpreting Post’s programme
inferred← citeshttps://doi.org/10.1016/j.apal.2019.102716openalex-snapshot
Reductions between types of numberings
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.07.001openalex-snapshot
Index sets and universal numberings
inferred← citeshttps://doi.org/10.1017/bsl.2017.41openalex-snapshot
A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES
inferred← citeshttps://doi.org/10.1090/s0002-9947-09-04910-1openalex-snapshot
Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees
inferred← citeshttps://doi.org/10.1093/logcom/exq034openalex-snapshot
Model-theoretic properties of the n-c.e. degrees
inferred← citeshttps://doi.org/10.3233/com-180089openalex-snapshot
Finitely generated semiautomatic groups
inferred← citeshttps://doi.org/10.3233/com-180092openalex-snapshot
S. Barry Cooper (1943–2015)
inferred← citeshttps://doi.org/10.53733/133openalex-snapshot
Hierarchy of Computably Enumerable Degrees II
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.