On the public citation graph

A theorem on hyperhypersimple sets

0 signed · 34 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.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-1956-0083454-0openalex-snapshot
Recursive and Recursively Enumerable Orders
inferredcites →https://doi.org/10.1305/ndjfl/1093956971openalex-snapshot
A theorem on maximal sets.
inferredcites →https://doi.org/10.2307/2964290openalex-snapshot
Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

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.19660120125openalex-snapshot
Classes of Recursively Enumerable Sets and Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1002/malq.19680142105openalex-snapshot
A Dichotomy of the Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1002/malq.19950410311openalex-snapshot
Some New Lattice Constructions in High R. E. Degrees
inferred← citeshttps://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferred← citeshttps://doi.org/10.1007/bf00967170openalex-snapshot
Supersets of recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/bf01156252openalex-snapshot
Effectively hyperimmune sets and majorants
inferred← citeshttps://doi.org/10.1007/bf01163964openalex-snapshot
Pointwise decomposable sets
inferred← citeshttps://doi.org/10.1007/bf02219042openalex-snapshot
Remarks on retraceable, regressive, and pointwise-decomposable sets
inferred← citeshttps://doi.org/10.1007/s00153-024-00958-xopenalex-snapshot
Constructivity conditions on immune sets
inferred← citeshttps://doi.org/10.1007/s10469-012-9161-1openalex-snapshot
Computably enumerable sets and related issues
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90146-zopenalex-snapshot
Twenty questions to a p-selector
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70025-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1090/s0002-9904-1978-14447-4openalex-snapshot
On the theory of Π₃¹ sets of reals
inferred← citeshttps://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferred← citeshttps://doi.org/10.1090/s0002-9939-1966-0216950-5openalex-snapshot
Completeness, the Recursion Theorem, and Effectively Simple Sets
inferred← citeshttps://doi.org/10.1090/s0002-9939-1973-0340010-xopenalex-snapshot
On retraceable sets with rapid growth
inferred← citeshttps://doi.org/10.1090/s0002-9947-1968-0227009-1openalex-snapshot
On the Lattice of Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1090/s0002-9947-1969-0239973-6openalex-snapshot
Recursive density types. I
inferred← citeshttps://doi.org/10.1090/s0002-9947-1969-0250870-2openalex-snapshot
Recursive Density Types. II
inferred← citeshttps://doi.org/10.1090/s0002-9947-1970-0265157-xopenalex-snapshot
Recursive functions modulo 𝐶𝑂-𝑟-maximal sets
inferred← citeshttps://doi.org/10.1090/s0002-9947-1974-0469729-2openalex-snapshot
Deficiency Sets and Bounded Information Reducibilities
inferred← citeshttps://doi.org/10.1090/tran/1968-130-01openalex-snapshot
inferred← citeshttps://doi.org/10.1093/logcom/exm032openalex-snapshot
Post's Programme for the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1142/9789812770837_0012openalex-snapshot
The Complexity of the Set of Nonrandom Numbers
inferred← citeshttps://doi.org/10.1142/s0219061313500050openalex-snapshot
ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
inferred← citeshttps://doi.org/10.1215/ijm/1256050747openalex-snapshot
A lattice property of post's simple set
inferred← citeshttps://doi.org/10.2140/pjm.1969.31.215openalex-snapshot
Cohesive sets and recursively enumerable Dedekind cuts
inferred← citeshttps://doi.org/10.2307/2270912openalex-snapshot
The degrees of hyperhyperimmune sets
inferred← citeshttps://doi.org/10.2307/2271653openalex-snapshot
Simplicity of recursively enumerable sets
inferred← citeshttps://doi.org/10.2307/2272061openalex-snapshot
Minimal degrees and the jump operator
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.