On the public citation graph
tt- andm-degrees
0 signed · 48 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.1002/malq.19620080313openalex-snapshot
Recursively Enumerable Sets and Retracing Functions
inferredcites →https://doi.org/10.1007/bf02219729openalex-snapshot
Hypersimple sets with retraceable complements
inferredcites →https://doi.org/10.1007/bf02219743openalex-snapshot
Two theorems on many-one degrees of recursively enumerable 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-9947-1968-0220595-7openalex-snapshot
Semirecursive Sets and Positive Reducibility
inferredcites →https://doi.org/10.2307/2270621openalex-snapshot
Linear orderings under one-one reducibility
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19940400407openalex-snapshot
Recursively Enumerable Equivalence Relations Modulo Finite Differences
inferred← citeshttps://doi.org/10.1007/978-1-4615-0755-0_13openalex-snapshot
Quasi-Degrees of Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1007/bf00750555openalex-snapshot
One strengthening ofQ-reducibility
inferred← citeshttps://doi.org/10.1007/bf00967105openalex-snapshot
Reducibility of partial recursive functions
inferred← citeshttps://doi.org/10.1007/bf01053261openalex-snapshot
Recursive versus recursively enumerable binary relations
inferred← citeshttps://doi.org/10.1007/bf01152759openalex-snapshot
On the congruence of the upper semilattices of recursively enumerable m-powers and tabular powers
inferred← citeshttps://doi.org/10.1007/bf01156253openalex-snapshot
Semilattices of disjunctive and linear degrees
inferred← citeshttps://doi.org/10.1007/bf01157017openalex-snapshot
A class of hypersimple incomplete sets
inferred← citeshttps://doi.org/10.1007/bf01620762openalex-snapshot
Recursively enumerablem- andtt-degrees II: The distribution of singular degrees
inferred← citeshttps://doi.org/10.1007/bf01669003openalex-snapshot
The existence of recursively enumerable minimal truth-tabular degrees
inferred← citeshttps://doi.org/10.1007/bf01673943openalex-snapshot
tt-Degrees of recursively enumerable turing degrees. II
inferred← citeshttps://doi.org/10.1007/bf01673953openalex-snapshot
Several results on upper semilattices andm-degrees
inferred← citeshttps://doi.org/10.1007/bf01876317openalex-snapshot
Partially ordered sets of 1-degrees, contained in recursively enumerable m-degrees
inferred← citeshttps://doi.org/10.1007/bf01978882openalex-snapshot
Degrees of denumerability reducibilities
inferred← citeshttps://doi.org/10.1007/bf01979647openalex-snapshot
Relations between table-type degrees
inferred← citeshttps://doi.org/10.1007/bf01980610openalex-snapshot
Property of t-retraceability and automorphisms of a lattice of recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/bf02360877openalex-snapshot
Complexity properties of recursively enumerable sets andsQ-completeness
inferred← citeshttps://doi.org/10.1007/bf02676727openalex-snapshot
Complexity properties of recursively enumerable sets andbsQ-completeness
inferred← citeshttps://doi.org/10.1007/bfb0022573openalex-snapshot
Recursion theoretic properties of frequency computation and bounded queries (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0086118openalex-snapshot
A direct construction of a minimal recursively enumerable truth-table degree
inferred← citeshttps://doi.org/10.1007/s10469-012-9161-1openalex-snapshot
Computably enumerable sets and related issues
inferred← citeshttps://doi.org/10.1007/s10469-017-9439-4openalex-snapshot
Irreducible, Singular, and Contiguous Degrees
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90146-zopenalex-snapshot
Twenty questions to a p-selector
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
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.1134/s1995080221120076openalex-snapshot
On 1-Degrees Inside $$\boldsymbol{m}$$-Degrees
inferred← citeshttps://doi.org/10.1305/ndjfl/1187031408openalex-snapshot
Cuppability of Simple and Hypersimple Sets
inferred← citeshttps://doi.org/10.2307/2274468openalex-snapshot
Undecidability and initial segments of the (r.e.) tt-degrees
inferred← citeshttps://doi.org/10.2307/2274869openalex-snapshot
Recursively enumerable m- and tt-degrees. I: The quantity of m-degrees
inferred← citeshttps://doi.org/10.2307/2275754openalex-snapshot
Degree theoretic definitions of the low2 recursively enumerable sets
inferred← citeshttps://doi.org/10.2307/2695042openalex-snapshot
On the structures inside truth-table 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.