On the public citation graph

Three easy constructions of recursively enumerable sets

https://doi.org/10.1007/bfb0090941
0 signed · 28 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.1016/0003-4843(75)90007-8openalex-snapshot
The weak truth table degrees of recursively enumerable sets
inferredcites →https://doi.org/10.1017/s0022481200051598openalex-snapshot
The infinite injury priority method
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-9939-1954-0063995-6openalex-snapshot
A Theorem on Hypersimple Sets
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1112/plms/s3-16.1.537openalex-snapshot
Lower Bounds for Pairs of Recursively Enumerable 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/2269807openalex-snapshot
A minimal pair of recursively enumerable degrees
inferredcites →https://doi.org/10.2307/2272252openalex-snapshot
The infinite injury priority method
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.4153/cjm-1958-035-xopenalex-snapshot
Retraceable Sets

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.19960420122openalex-snapshot
Splittings of 0' into the Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_34openalex-snapshot
On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets
inferred← citeshttps://doi.org/10.1007/bf02565029openalex-snapshot
Some results about the R.E. degrees
inferred← citeshttps://doi.org/10.1007/bfb0076222openalex-snapshot
Genericity for recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/bfb0076231openalex-snapshot
Reflection and the priority method in E-recursion theory
inferred← citeshttps://doi.org/10.1007/s00224-012-9424-1openalex-snapshot
Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees
inferred← citeshttps://doi.org/10.1007/s00224-026-10297-4openalex-snapshot
On Disjunctive Degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90071-0openalex-snapshot
Structural interactions of the recursively enumerable T- and W-degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(89)90005-5openalex-snapshot
Intervals and sublattices of the R.E. weak truth table degrees, part I: Density
inferred← citeshttps://doi.org/10.1016/0168-0072(89)90031-6openalex-snapshot
Intervals and sublattices of the r.e. weak truth table degrees, part II: Nonbounding
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(08)70025-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1090/s0002-9947-1984-0737882-5openalex-snapshot
On Pairs of Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.1305/ndjfl/1039700747openalex-snapshot
Infima in the Recursively Enumerable Weak Truth Table Degrees
inferred← citeshttps://doi.org/10.2178/bsl/1154698741openalex-snapshot
Calibrating Randomness
inferred← citeshttps://doi.org/10.2307/2273948openalex-snapshot
Pairs without infimum in the recursively enumerable weak truth table degrees
inferred← citeshttps://doi.org/10.32657/10356/139815openalex-snapshot
Computability theory and degree structures
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.