On the public citation graph

Degree theoretic definitions of the low2 recursively enumerable sets

0 signed · 50 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/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/978-3-662-21755-9openalex-snapshot
Degrees of Unsolvability
inferredcites →https://doi.org/10.1007/bf01621095openalex-snapshot
Working below a low2 recursively enumerably degree
inferredcites →https://doi.org/10.1007/bf01670286openalex-snapshot
Three theorems ontt-degrees
inferredcites →https://doi.org/10.1007/bf02219290openalex-snapshot
tt- andm-degrees
inferredcites →https://doi.org/10.1007/bfb0076211openalex-snapshot
Recursion Theory Week
inferredcites →https://doi.org/10.1007/bfb0086116openalex-snapshot
Array nonrecursive sets and multiple permitting arguments
inferredcites →https://doi.org/10.1007/bfb0086118openalex-snapshot
A direct construction of a minimal recursively enumerable truth-table degree
inferredcites →https://doi.org/10.1007/bfb0090937openalex-snapshot
Hierarchies of sets and degrees below 0′
inferredcites →https://doi.org/10.1016/0003-4843(80)90004-2openalex-snapshot
Reducibility orderings: Theories, definability and automorphisms
inferredcites →https://doi.org/10.1016/0168-0072(89)90011-0openalex-snapshot
Completely mitotic R.E. degrees
inferredcites →https://doi.org/10.1016/0168-0072(90)90062-7openalex-snapshot
Lattice nonembeddings and initial segments of the recursively enumerable degrees
inferredcites →https://doi.org/10.1016/s0049-237x(06)80046-7openalex-snapshot
Rigidity and definability in the noncomputable universe
inferredcites →https://doi.org/10.1016/s0049-237x(08)71260-6openalex-snapshot
Second order logic and first order theories of reducibility orderings*
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7060-0openalex-snapshot
The Kleene Symposium
inferredcites →https://doi.org/10.1016/s0049-237x(99)x8037-2openalex-snapshot
Classical Recursion Theory
inferredcites →https://doi.org/10.1017/s0022481200051252openalex-snapshot
Degrees of classes of RE sets
inferredcites →https://doi.org/10.1070/sm1979v035n02abeh001463openalex-snapshot
ON $tt$-DEGREES OF RECURSIVELY ENUMERABLE TURING DEGREES
inferredcites →https://doi.org/10.1090/pspum/042/791051openalex-snapshot
The structure of the degrees of unsolvability
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
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-1969-0241295-4openalex-snapshot
On the Degrees of Index Sets. II
inferredcites →https://doi.org/10.1090/s0002-9947-1972-0316227-0openalex-snapshot
Π⁰₁ classes and degrees of theories
inferredcites →https://doi.org/10.1090/s0002-9947-1987-0879565-xopenalex-snapshot
T-Degrees, Jump Classes, and Strong Reducibilities
inferredcites →https://doi.org/10.1090/s0273-0979-1981-14863-1openalex-snapshot
Strong reducibilities
inferredcites →https://doi.org/10.1145/321864.321877openalex-snapshot
On the Structure of Polynomial Time Reducibility
inferredcites →https://doi.org/10.1215/ijm/1255987056openalex-snapshot
Array nonrecursive degrees and lattice embeddings of the diamond
inferredcites →https://doi.org/10.2307/1996261openalex-snapshot
∏ 0 1 Classes and Degrees of Theories
inferredcites →https://doi.org/10.2307/2270328openalex-snapshot
Degrees of recursively enumerable sets which have no maximal supersets
inferredcites →https://doi.org/10.2307/2270510openalex-snapshot
Axiomatizable theories with few axiomatizable extensions
inferredcites →https://doi.org/10.2307/2272061openalex-snapshot
Minimal degrees and the jump operator
inferredcites →https://doi.org/10.2307/2273100openalex-snapshot
Recursively enumerable generic sets
inferredcites →https://doi.org/10.2307/2273510openalex-snapshot
Double jumps of minimal degrees
inferredcites →https://doi.org/10.2307/2274869openalex-snapshot
Recursively enumerable m- and tt-degrees. I: The quantity of m-degrees
inferredcites →https://doi.org/10.2307/2275099openalex-snapshot
Working below a high recursively enumerable degree
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/11750321_3openalex-snapshot
Totally < ω ω Computably Enumerable and m-topped Degrees
inferred← citeshttps://doi.org/10.1007/978-3-662-22108-2_2openalex-snapshot
Intervals Without Critical Triples
inferred← citeshttps://doi.org/10.1007/bf02762706openalex-snapshot
Lattice embeddings below a nonlow2 recursively enumerable degree
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00044-5openalex-snapshot
Nonbounding and Slaman triples
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80019-6openalex-snapshot
Reducibilities
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80022-6openalex-snapshot
The Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00028-8openalex-snapshot
Embeddings of N5 and the contiguous degrees
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00114-2openalex-snapshot
Classes bounded by incomplete sets
inferred← citeshttps://doi.org/10.1017/9781316716830.005openalex-snapshot
Intervals without Critical Triples
inferred← citeshttps://doi.org/10.1017/bsl.2017.41openalex-snapshot
A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES
inferred← citeshttps://doi.org/10.1017/jsl.2021.72openalex-snapshot
ON SUPERSETS OF NON-LOW SETS
inferred← citeshttps://doi.org/10.1112/s002461159800046xopenalex-snapshot
Interpretability and Definability in the Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.1142/s0219061307000640openalex-snapshot
TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
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.