On the public citation graph

A note on universal sets

https://doi.org/10.2307/2269692
0 signed · 33 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.1515/9781400882007openalex-snapshot
Theory of Formal Systems. (AM-47)

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.19930390106openalex-snapshot
A variant of the Notion of Semicreative set
inferred← citeshttps://doi.org/10.1002/malq.19990450102openalex-snapshot
Bounded Immunity and Btt‐Reductions
inferred← citeshttps://doi.org/10.1002/malq.202300033openalex-snapshot
On bQ1$bQ_1$‐degrees of c.e. sets
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/bf01152759openalex-snapshot
On the congruence of the upper semilattices of recursively enumerable m-powers and tabular powers
inferred← citeshttps://doi.org/10.1007/bf01462257openalex-snapshot
Truth tabular degrees of recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/bf01462921openalex-snapshot
On completebtt-degrees
inferred← citeshttps://doi.org/10.1007/bf01673573openalex-snapshot
Structure of the upper semilattice of recursively enumerablem -degrees and related questions. I
inferred← citeshttps://doi.org/10.1007/bf01673946openalex-snapshot
Structures of the degrees of unsolvability of index sets
inferred← citeshttps://doi.org/10.1007/bf01673953openalex-snapshot
Several results on upper semilattices andm-degrees
inferred← citeshttps://doi.org/10.1007/bf01978978openalex-snapshot
Relations between reducibilities of table type
inferred← citeshttps://doi.org/10.1007/bf02219043openalex-snapshot
On inseparable pairs
inferred← citeshttps://doi.org/10.1007/bf02219444openalex-snapshot
Onm - degrees of recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/bf02219655openalex-snapshot
On nonprincipal enumerations
inferred← citeshttps://doi.org/10.1007/bf02367214openalex-snapshot
A property of creative sets
inferred← citeshttps://doi.org/10.1007/bf02674875openalex-snapshot
Some reducibilities and splittings of recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/s10469-012-9161-1openalex-snapshot
Computably enumerable sets and related issues
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70025-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70194-6openalex-snapshot
Small Degrees in Ordinary Recursion Theory
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00114-2openalex-snapshot
Classes bounded by incomplete sets
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00028-7openalex-snapshot
Kolmogorov entropy in the context of computability theory
inferred← citeshttps://doi.org/10.1017/9781316755921.008openalex-snapshot
Simple sets and ideals under m-reducibility
inferred← citeshttps://doi.org/10.1070/rm1979v034n03abeh003988openalex-snapshot
REDUCIBILITIES OF TABULAR TYPE IN THE THEORY OF ALGORITHMS
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-1975-0357087-xopenalex-snapshot
$\mathrm{wtt}$-complete sets are not necessarily $\mathrm{tt}$-complete
inferred← citeshttps://doi.org/10.1090/s0002-9939-1985-0781069-3openalex-snapshot
Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees
inferred← citeshttps://doi.org/10.1090/s0273-0979-1981-14863-1openalex-snapshot
Strong reducibilities
inferred← citeshttps://doi.org/10.1305/ndjfl/1187031408openalex-snapshot
Cuppability of Simple and Hypersimple Sets
inferred← citeshttps://doi.org/10.2307/1970579openalex-snapshot
On Some Games Which Are Relevant to the Theory of Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.2307/2273476openalex-snapshot
Kleene index sets and functional m-degrees
inferred← citeshttps://doi.org/10.26907/2949-3919.2026.1.47-66openalex-snapshot
Computable covers for arithmetical collections of programming systems
inferred← citeshttps://doi.org/10.4213/mzm1160openalex-snapshot
О некоторых сводимостях и разбиениях рекурсивно перечислимых множеств
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.