On the public citation graph
Working below a low2 recursively enumerably degree
0 signed · 39 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.
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.
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-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bf01621095openalex-snapshot
Working below a low2 recursively enumerably degree
inferredcites →https://doi.org/10.1007/bfb0076217openalex-snapshot
Embeddings and extensions of embeddings in the r.e. tt and wtt-degrees
inferredcites →https://doi.org/10.1016/0003-4843(75)90007-8openalex-snapshot
The weak truth table degrees of recursively enumerable sets
inferredcites →https://doi.org/10.1016/s0049-237x(08)70940-6openalex-snapshot
On the ∀∃-Sentences of α-Recursion Theory
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-1980-0572317-9openalex-snapshot
Decomposition of Recursively Enumerable Degrees
inferredcites →https://doi.org/10.1090/s0002-9939-1988-0958085-4openalex-snapshot
Defining Jump Classes in the Degrees Below 0'
inferredcites →https://doi.org/10.2307/1970776openalex-snapshot
Interpolation and Embedding in the Recursively Enumerable Degrees
inferredcites →https://doi.org/10.2307/1970889openalex-snapshot
Jump Restricted Interpolation in the Recursively Enumerable Degrees
inferredcites →https://doi.org/10.2307/2275099openalex-snapshot
Working below a high recursively enumerable degree
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(200201)48:1<131::aid-malq131>3.0.co;2-zopenalex-snapshot
A nonlow2 R. E. Degree with the Extension of Embeddings Properties of a low2 Degree
inferred← citeshttps://doi.org/10.1002/malq.19930390151openalex-snapshot
Highness and bounding minimal pairs
inferred← citeshttps://doi.org/10.1007/978-1-4615-0755-0_12openalex-snapshot
Definable Relations on the Computably Enumerable Degrees
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_7openalex-snapshot
Elementary Differences Among Jump Hierarchies
inferred← citeshttps://doi.org/10.1007/bf02762706openalex-snapshot
Lattice embeddings below a nonlow2 recursively enumerable degree
inferred← citeshttps://doi.org/10.1007/s00153-008-0083-5openalex-snapshot
On Lachlan’s major sub-degree problem
inferred← citeshttps://doi.org/10.1007/s00153-009-0150-6openalex-snapshot
The ∀∃-theory of the effectively closed Medvedev degrees is decidable
inferred← citeshttps://doi.org/10.1007/s10958-021-05418-yopenalex-snapshot
Turing Computability: Structural Theory
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90234-5openalex-snapshot
Splitting theorems in recursion theory
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00044-5openalex-snapshot
Nonbounding and Slaman triples
inferred← citeshttps://doi.org/10.1016/j.apal.2005.06.005openalex-snapshot
The existence of high nonbounding degrees in the difference hierarchy
inferred← citeshttps://doi.org/10.1016/j.apal.2007.11.014openalex-snapshot
On strongly jump traceable reals
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.029openalex-snapshot
Elementary differences among jump classes
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.09.020openalex-snapshot
On the number of infinite sequences with trivial initial segment complexity
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80020-2openalex-snapshot
Local Degree Theory* *Preparation of this paper partially supported by E.P.S.R.C. research grants nos. GR/H91213 and GR/H02165, and by EC Human Capital and Mobility network ‘Complexity, Logic and Recursion Theory’.
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80022-6openalex-snapshot
The Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.1017/s0960129516000244openalex-snapshot
Splitting and non-splitting in the difference hierarchy
inferred← citeshttps://doi.org/10.1090/s0002-9939-1992-1105037-0openalex-snapshot
A splitting theorem for the 𝑛-r.e. degrees
inferred← citeshttps://doi.org/10.12962/j1829605x.v1i2.1356openalex-snapshot
On Elementary Di®erences Among Jump Classes
inferred← citeshttps://doi.org/10.1360/04ys0181openalex-snapshot
The lown and lowm r. e. degrees are not elementarily equivalent
inferred← citeshttps://doi.org/10.2178/jsl/1052669063openalex-snapshot
Decomposition and infima in the computably enumerable degrees
inferred← citeshttps://doi.org/10.2178/jsl/1190150292openalex-snapshot
Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable
inferred← citeshttps://doi.org/10.2307/2275099openalex-snapshot
Working below a high recursively enumerable degree
inferred← citeshttps://doi.org/10.2307/2275754openalex-snapshot
Degree theoretic definitions of the low2 recursively enumerable sets
inferred← citeshttps://doi.org/10.2307/421171openalex-snapshot
Definability in the Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.32657/10356/165558openalex-snapshot
Cupping in the computably enumerable degrees
showing the first 26 of 27 · page through all 27
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.