On the public citation graph

r-Maximal major subsets

https://doi.org/10.1007/bf02761377
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.1002/malq.19660120125openalex-snapshot
Classes of Recursively Enumerable Sets and Degrees of Unsolvability
inferredcites →https://doi.org/10.1002/malq.19680142105openalex-snapshot
A Dichotomy of the Recursively Enumerable Sets
inferredcites →https://doi.org/10.1017/s0022481200051252openalex-snapshot
Degrees of classes of RE sets
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-9904-1974-13350-1openalex-snapshot
Automorphisms of the lattice of recursively enumerable sets
inferredcites →https://doi.org/10.1090/s0002-9947-1963-0155747-3openalex-snapshot
Recursive enumerability and the jump operator
inferredcites →https://doi.org/10.1090/s0002-9947-1968-0227009-1openalex-snapshot
On the Lattice of Recursively Enumerable Sets
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1215/s0012-7094-68-03513-8openalex-snapshot
The elementary theory of recursively enumerable sets
inferredcites →https://doi.org/10.2307/1970028openalex-snapshot
On Degrees of Unsolvability
inferredcites →https://doi.org/10.2307/1970579openalex-snapshot
On Some Games Which Are Relevant to the Theory of Recursively Enumerable Sets
inferredcites →https://doi.org/10.2307/1970842openalex-snapshot
Automorphisms of the Lattice of Recursively Enumerable Sets Part I: Maximal Sets
inferredcites →https://doi.org/10.2307/2270255openalex-snapshot
Some theorems on R-maximal sets and major subsets of recursively enumerable sets
inferredcites →https://doi.org/10.2307/2270328openalex-snapshot
Degrees of recursively enumerable sets which have no maximal supersets
inferredcites →https://doi.org/10.2307/2272830openalex-snapshot
Nowhere simple sets and the lattice of recursively enumerable sets
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferred← citeshttps://doi.org/10.1007/bf01978419openalex-snapshot
Densely simple sets with retraceable complements
inferred← citeshttps://doi.org/10.1007/bf01980610openalex-snapshot
Property of t-retraceability and automorphisms of a lattice of recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/bf02760850openalex-snapshot
Splitting properties and jump classes
inferred← citeshttps://doi.org/10.1007/bf02761827openalex-snapshot
Major subsets ofα-recursively enumerable sets
inferred← citeshttps://doi.org/10.1016/0168-0072(83)90031-3openalex-snapshot
The intervals of the lattice of recursively enumerable sets determined by major subsets
inferred← citeshttps://doi.org/10.1016/j.aim.2019.106884openalex-snapshot
R.e. prime powers and total rigidity
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70044-2openalex-snapshot
Automorphisms of the Lattice of Recursively Enumerable Sets and Hyperhypersimple Sets
inferred← citeshttps://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-1980-0549153-7openalex-snapshot
A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.2140/pjm.1980.87.135openalex-snapshot
d-simple sets, small sets, and degree classes
inferred← citeshttps://doi.org/10.2140/pjm.1982.100.445openalex-snapshot
Invariance of properties under automorphisms of the lattice of recursively enumerable sets
inferred← citeshttps://doi.org/10.2307/2272830openalex-snapshot
Nowhere simple sets and the lattice of recursively enumerable sets
inferred← citeshttps://doi.org/10.2307/2273461openalex-snapshot
Orbits of hyperhypersimple sets and the lattice of Σ03 sets
inferred← citeshttps://doi.org/10.2307/2274090openalex-snapshot
On the orbits of hyperhypersimple sets
inferred← citeshttps://doi.org/10.2307/2274662openalex-snapshot
Boolean algebras and orbits of the lattice of r.e sets modulo the finite sets
inferred← citeshttps://doi.org/10.2307/421206openalex-snapshot
Definable Encodings in the Computably Enumerable Sets
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.