On the public citation graph

Upper semilattice of recursively enumerable sQ-degrees

https://doi.org/10.1007/bf01985061

0 signed · 21 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.1007/978-3-662-02460-7openalex-snapshot

Recursively Enumerable Sets and Degrees

inferredcites →https://doi.org/10.1007/bf01979705openalex-snapshot

Upper semilattice of recursively enumerable 124-1124-1124-1-degrees

inferredcites →https://doi.org/10.1007/bf02219444openalex-snapshot

Onm - degrees of recursively enumerable sets

inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot

Recursively enumerable sets and degrees

inferredcites →https://doi.org/10.1215/s0012-7094-65-03247-3openalex-snapshot

Three theorems on the degrees of recursively enumerable sets

inferredcites →https://doi.org/10.2307/2271876openalex-snapshot

Computational complexity, speedable and levelable sets

inferredcites →https://doi.org/10.2307/2271984openalex-snapshot

On complexity properties of recursively enumerable sets

inferredcites →https://doi.org/10.2307/2272830openalex-snapshot

Nowhere simple sets and the lattice of recursively enumerable sets

inferredcites →https://doi.org/10.2307/2274096openalex-snapshot

Effectively nowhere simple sets

inferredcites →https://doi.org/10.2307/2316720openalex-snapshot

Theory of Recursive Functions and Effective Computability.

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.201900087openalex-snapshot

r‐Maximal sets and Q1,N‐reducibility

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/bf02674875openalex-snapshot

Some reducibilities and splittings of recursively enumerable sets

inferred← citeshttps://doi.org/10.1007/s00153-006-0012-4openalex-snapshot

Strong Enumeration Reducibilities

inferred← citeshttps://doi.org/10.1007/s00153-010-0216-5openalex-snapshot

Immunity properties and strong positive reducibilities

inferred← citeshttps://doi.org/10.1007/s00153-012-0278-7openalex-snapshot

Q 1-degrees of c.e. sets

inferred← citeshttps://doi.org/10.1007/s00153-022-00847-1openalex-snapshot

$$sQ_1$$-degrees of computably enumerable sets

inferred← citeshttps://doi.org/10.1093/jigpal/jzae005openalex-snapshot

Non-empty open intervals of computably enumerable sQ1-degrees

inferred← citeshttps://doi.org/10.1093/jigpal/jzaf072openalex-snapshot

On minimal pairs of quasi-degrees

inferred← citeshttps://doi.org/10.1093/logcom/exy036openalex-snapshot

On the connections between $wtt$- and $Q$-reducibilities

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.