On the public citation graph
Some theorems on R-maximal sets and major subsets of recursively enumerable sets
0 signed · 24 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.1002/malq.19660120125openalex-snapshot
Classes of Recursively Enumerable Sets and Degrees of Unsolvability
inferredcites →https://doi.org/10.1017/s0022481200092197openalex-snapshot
Turing degrees and many-one degrees of maximal sets
inferredcites →https://doi.org/10.1090/s0002-9947-1967-0215714-1openalex-snapshot
Two Theorems on Hyperhypersimple Sets
inferredcites →https://doi.org/10.1090/s0002-9947-1968-0227009-1openalex-snapshot
On the Lattice of Recursively Enumerable Sets
inferredcites →https://doi.org/10.1090/s0002-9947-1970-0265157-xopenalex-snapshot
Recursive functions modulo 𝐶𝑂-𝑟-maximal sets
inferredcites →https://doi.org/10.2307/1995381openalex-snapshot
Recursive Functions Modulo Co-r-Maximal 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.19950410311openalex-snapshot
Some New Lattice Constructions in High R. E. Degrees
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)90008-6openalex-snapshot
On speedable and levelable vector spaces
inferred← citeshttps://doi.org/10.1023/a:1013930408357openalex-snapshot
Major Sets, Classes of Simple Sets, and $$Q $$ -Complete Sets
inferred← citeshttps://doi.org/10.1090/s0002-9904-1974-13350-1openalex-snapshot
Automorphisms of the lattice of recursively enumerable sets
inferred← citeshttps://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferred← citeshttps://doi.org/10.1093/logcom/ext046openalex-snapshot
Definable relations in Turing degree structures
inferred← citeshttps://doi.org/10.2140/pjm.1980.87.135openalex-snapshot
d-simple sets, small sets, and degree classes
inferred← citeshttps://doi.org/10.2178/jsl/1190150104openalex-snapshot
Definable incompleteness and Friedberg splittings
inferred← citeshttps://doi.org/10.2307/1970842openalex-snapshot
Automorphisms of the Lattice of Recursively Enumerable Sets Part I: Maximal Sets
inferred← citeshttps://doi.org/10.2307/2275099openalex-snapshot
Working below a high recursively enumerable degree
inferred← citeshttps://doi.org/10.3103/s1066369x1402011xopenalex-snapshot
Definable relations in Turing degree structures
inferred← citeshttps://doi.org/10.4213/mzm331openalex-snapshot
Мажорные множества, классы простых множеств и $Q$-полные множества
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.