On the public citation graph
Recursively enumerable classes and their application to recursive sequences of formal theories
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.
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.1090/s0002-9947-1958-0097310-7openalex-snapshot
Some Theorems on Classes of Recursively Enumerable Sets
inferredcites →https://doi.org/10.2307/2964056openalex-snapshot
Two theories with axioms built by means of pleonasms
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.19640100802openalex-snapshot
A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION
inferred← citeshttps://doi.org/10.1006/inco.1998.2782openalex-snapshot
The Synthesis of Language Learners
inferred← citeshttps://doi.org/10.1007/978-3-031-64309-5_11openalex-snapshot
On Arithmetical Numberings in Reverse Mathematics
inferred← citeshttps://doi.org/10.1007/bf01837553openalex-snapshot
On the relation provable equivalence and on partitions in effectively inseparable sets
inferred← citeshttps://doi.org/10.1007/bf02671553openalex-snapshot
Generalized computable numerations and nontrivial rogers semilattices
inferred← citeshttps://doi.org/10.1007/bfb0086122openalex-snapshot
Recursive enumeration without repetition revisited
inferred← citeshttps://doi.org/10.1007/s00153-008-0065-7openalex-snapshot
Effectively closed sets and enumerations
inferred← citeshttps://doi.org/10.1023/a:1015352513117openalex-snapshot
Friedberg Numberings of Families of n-Computably Enumerable Sets
inferred← citeshttps://doi.org/10.1090/s0002-9939-1966-0207556-2openalex-snapshot
A Theorem on Recursively Enumerable Classes and Splinters
inferred← citeshttps://doi.org/10.1090/s0002-9947-1971-0276084-7openalex-snapshot
The Family of all Recursively Enumerable Classes of Finite Sets
inferred← citeshttps://doi.org/10.1093/logcom/exs073openalex-snapshot
A Tribute to Marian Boykan Pour-El (1928–2009)
inferred← citeshttps://doi.org/10.2307/2273443openalex-snapshot
Classifying positive equivalence relations
inferred← citeshttps://doi.org/10.2307/2586612openalex-snapshot
On recursive enumerability with finite repetitions
inferred← citeshttps://doi.org/10.48550/arxiv.1508.04387openalex-snapshot
Game arguments in some existence theorems of Friedberg numberings
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.