On the public citation graph

The last question on recursively enumerablem-degrees

https://doi.org/10.1007/bf00739571
0 signed · 20 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/bf01673573openalex-snapshot
Structure of the upper semilattice of recursively enumerablem -degrees and related questions. I
inferredcites →https://doi.org/10.1007/bf01673953openalex-snapshot
Several results on upper semilattices andm-degrees
inferredcites →https://doi.org/10.1007/bf02218612openalex-snapshot
Recursively enumerable many-one degrees
inferredcites →https://doi.org/10.1016/0168-0072(94)00048-8openalex-snapshot
Interpreting true arithmetic in the theory of the r.e. truth table degrees
inferredcites →https://doi.org/10.1016/s0049-237x(99)x8037-2openalex-snapshot
Classical 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/s0273-0979-1982-14970-9openalex-snapshot
The undecidability of the recursively enumerable degrees
inferredcites →https://doi.org/10.1112/jlms/s2-24.1.1openalex-snapshot
The Theory of the Degrees below 0 ′
inferredcites →https://doi.org/10.2307/2275436openalex-snapshot
The theory of the recursively enumerable weak truth-table degrees is undecidable

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-662-22108-2_6openalex-snapshot
Noninterpretability of Infinite Linear Orders
inferred← citeshttps://doi.org/10.1007/s00153-018-0647-yopenalex-snapshot
Elementary theories and hereditary undecidability for semilattices of numberings
inferred← citeshttps://doi.org/10.1007/s10469-012-9161-1openalex-snapshot
Computably enumerable sets and related issues
inferred← citeshttps://doi.org/10.1016/0168-0072(94)00048-8openalex-snapshot
Interpreting true arithmetic in the theory of the r.e. truth table degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102811openalex-snapshot
The theory of ceers computes true arithmetic
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00021-xopenalex-snapshot
Interpreting N in the computably enumerable weak truth table degrees
inferred← citeshttps://doi.org/10.1017/9781316716830.009openalex-snapshot
Noninterpretability of Infinite Linear Orders
inferred← citeshttps://doi.org/10.1090/s0002-9947-00-02652-0openalex-snapshot
Effectively dense Boolean algebras and their applications
inferred← citeshttps://doi.org/10.1134/s0037446625020016openalex-snapshot
On the Theory of Computably Enumerable Linear Preorders with Concatenation
inferred← citeshttps://doi.org/10.2178/jsl.7704070openalex-snapshot
Interpreting true arithmetic in the local structure of the enumeration degrees
inferred← citeshttps://doi.org/10.2178/jsl/1268917493openalex-snapshot
Interpreting true arithmetic in the -enumeration 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.