On the public citation graph
Enumeration reducibility, nondeterministic computations and relative computability of partial functions
0 signed · 162 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.19550010407openalex-snapshot
Effective operations on partial recursive functions
inferredcites →https://doi.org/10.1002/malq.19590050703openalex-snapshot
Reducibility and Completeness for Sets of Integers
inferredcites →https://doi.org/10.1002/malq.19650110104openalex-snapshot
Some Notions of Reducibility and Productiveness
inferredcites →https://doi.org/10.1002/malq.19680142105openalex-snapshot
A Dichotomy of the Recursively Enumerable Sets
inferredcites →https://doi.org/10.1002/malq.19690152004openalex-snapshot
Some applications of forcing to hierarchy problems in arithmetic
inferredcites →https://doi.org/10.1002/malq.19710170139openalex-snapshot
Arithmetical Reducibilities I
inferredcites →https://doi.org/10.1002/malq.19720180406openalex-snapshot
Arithmetical Reducibilities II
inferredcites →https://doi.org/10.1002/malq.19740201311openalex-snapshot
Maximal Arithmetical Reducibilities
inferredcites →https://doi.org/10.1002/malq.19740202507openalex-snapshot
Almost Recursivity and Partial Degrees
inferredcites →https://doi.org/10.1002/malq.19790250302openalex-snapshot
Masstheoretische Ergebnisse für WT‐Grade
inferredcites →https://doi.org/10.1002/malq.19790251303openalex-snapshot
Über Halbordnungen von WT‐Graden in e‐Graden
inferredcites →https://doi.org/10.1002/malq.19870330608openalex-snapshot
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
inferredcites →https://doi.org/10.1002/malq.19880340603openalex-snapshot
Properly Σ2 Enumeration Degrees
inferredcites →https://doi.org/10.1007/3-540-18170-9_149openalex-snapshot
Minimal pairs for polynomial time reducibilities
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bf00967372openalex-snapshot
E-powers of hyperimmune retraceable sets
inferredcites →https://doi.org/10.1007/bf00967734openalex-snapshot
Partial degrees of immune and hyperimmune sets
inferredcites →https://doi.org/10.1007/bf01709153openalex-snapshot
Exact bounds of denumerable collections of degrees of difficulty
inferredcites →https://doi.org/10.1007/bf01793784openalex-snapshot
On some filters and ideals of the Medvedev lattice
inferredcites →https://doi.org/10.1007/bf02787575openalex-snapshot
Upward closure and cohesive degrees
inferredcites →https://doi.org/10.1007/bf02937291openalex-snapshot
Weak density and cupping in the d-r.e. degrees
inferredcites →https://doi.org/10.1007/bfb0059544openalex-snapshot
Embedding nondistributive lattices in the recursively enumerable degrees
inferredcites →https://doi.org/10.1016/0003-4843(71)90003-9openalex-snapshot
Enumeration reducibility and partial degrees
inferredcites →https://doi.org/10.1016/0003-4843(72)90011-3openalex-snapshot
Degrees of unsolvability complementary between recursively enumerable degrees, Part 1
inferredcites →https://doi.org/10.1016/0168-0072(90)90051-3openalex-snapshot
On restricted forms of enumeration reducibility
inferredcites →https://doi.org/10.1016/0304-3975(75)90016-xopenalex-snapshot
A comparison of polynomial time reducibilities
inferredcites →https://doi.org/10.1016/0304-3975(82)90085-8openalex-snapshot
Strong nondeterministic polynomial-time reducibilities
inferredcites →https://doi.org/10.1016/s0022-0000(74)80025-5openalex-snapshot
Thirteenth annual IEEE Symposium on switching and automata theory
inferredcites →https://doi.org/10.1016/s0049-237x(08)70730-4openalex-snapshot
Lambda Calculus and Recursion Theory (Preliminary Version)
inferredcites →https://doi.org/10.1016/s0049-237x(08)71260-6openalex-snapshot
Second order logic and first order theories of reducibility orderings*
inferredcites →https://doi.org/10.1016/s0049-237x(99)x8037-2openalex-snapshot
Classical Recursion Theory
inferredcites →https://doi.org/10.1070/sm1979v035n03abeh001545openalex-snapshot
RELATIONSHIPS BETWEEN DIFFERENT FORMS OF RELATIVE COMPUTABILITY OF FUNCTIONS
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-1961-10652-6openalex-snapshot
A minimal degree less than 0’
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1090/s0002-9939-1961-0125794-xopenalex-snapshot
Note on Degrees of Partial Functions
inferredcites →https://doi.org/10.1090/s0002-9939-1973-0311467-5openalex-snapshot
A minimal partial degree ≤𝑂^{’}
inferredcites →https://doi.org/10.1090/s0002-9939-1988-0934883-8openalex-snapshot
On Quasi-Minimal e-Degrees and Total e-Degrees
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-0220595-7openalex-snapshot
Semirecursive Sets and Positive Reducibility
inferredcites →https://doi.org/10.1090/s0273-0979-1981-14863-1openalex-snapshot
Strong reducibilities
inferredcites →https://doi.org/10.1090/s0273-0979-1990-15923-3openalex-snapshot
The jump is definable in the structure of the degrees of unsolvability
inferredcites →https://doi.org/10.1109/swat.1972.29openalex-snapshot
The equivalence problem for regular expressions with squaring requires exponential space
inferredcites →https://doi.org/10.1112/plms/s3-16.1.537openalex-snapshot
Lower Bounds for Pairs of Recursively Enumerable Degrees
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
inferredcites →https://doi.org/10.1137/0207035openalex-snapshot
Polynomial Time Enumeration Reducibility
inferredcites →https://doi.org/10.1145/800105.803405openalex-snapshot
Reducibility, randomness, and intractibility (Abstract)
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1215/s0012-7094-65-03247-3openalex-snapshot
Three theorems on the degrees of recursively enumerable sets
inferredcites →https://doi.org/10.1305/ndjfl/1093635751openalex-snapshot
Embedding Brouwer algebras in the Medvedev lattice.
inferredcites →https://doi.org/10.1305/ndjfl/1093888400openalex-snapshot
Hyperenumeration reducibility.
inferredcites →https://doi.org/10.2307/1969604openalex-snapshot
On Degrees of Recursive Unsolvability
inferredcites →https://doi.org/10.2307/1969708openalex-snapshot
The Upper Semi-Lattice of Degrees of Recursive Unsolvability
inferredcites →https://doi.org/10.2307/2272061openalex-snapshot
Minimal degrees and the jump operator
inferredcites →https://doi.org/10.2307/2272849openalex-snapshot
Minimal pairs and high recursively enumerable degrees
inferredcites →https://doi.org/10.2307/2273104openalex-snapshot
Partial degrees and the density problem
inferredcites →https://doi.org/10.2307/2273730openalex-snapshot
Reducibilities in two models for combinatory logic
inferredcites →https://doi.org/10.2307/2273985openalex-snapshot
On minimal pairs of enumeration degrees
inferredcites →https://doi.org/10.2307/2274030openalex-snapshot
The degrees below a 1-generic degree < 0′
inferredcites →https://doi.org/10.2307/2274181openalex-snapshot
Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
inferredcites →https://doi.org/10.2307/2274313openalex-snapshot
On the T-degrees of partial functions
inferredcites →https://doi.org/10.2307/2274335openalex-snapshot
Jumps of quasi-minimal enumeration degrees
inferredcites →https://doi.org/10.2307/2274578openalex-snapshot
1-genericity in the enumeration degrees
inferredcites →https://doi.org/10.2307/2274668openalex-snapshot
Some remarks on the algebraic structure of the Medvedev Lattice
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.2307/2964178openalex-snapshot
Degrees of unsolvability associated with classes of formalized theories
inferredcites →https://doi.org/10.4064/fm-56-3-325-345openalex-snapshot
Some applications of the notions of forcing and generic sets
inferredcites →https://doi.org/10.4153/cjm-1970-010-6openalex-snapshot
Initial Segments of Many-One Degrees
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.19970430302openalex-snapshot
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds
inferred← citeshttps://doi.org/10.1002/malq.19970430411openalex-snapshot
Embeddings in the Strong Reducibilities Between 1 and npm
inferred← citeshttps://doi.org/10.1002/malq.19980440402openalex-snapshot
Some Special Pairs of Σ2 e‐Degrees
inferred← citeshttps://doi.org/10.1007/11780342_23openalex-snapshot
Enumeration Reducibility with Polynomial Time Bounds
inferred← citeshttps://doi.org/10.1007/978-1-4615-0755-0_15openalex-snapshot
Local Properties of the Non-Total Enumeration Degrees
inferred← citeshttps://doi.org/10.1007/978-3-031-64309-5_14openalex-snapshot
Learning Families of Algebraic Structures from Text
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_59openalex-snapshot
Cupping Classes of $\Sigma^0_2$ Enumeration Degrees
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_18openalex-snapshot
The Strongest Nonsplitting Theorem
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_77openalex-snapshot
Cupping $\Delta_2^0$ Enumeration Degrees to 0 e ′
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_49openalex-snapshot
Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_50openalex-snapshot
s-Degrees within e-Degrees
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_6openalex-snapshot
Strong Positive Reducibilities
inferred← citeshttps://doi.org/10.1007/bf01794984openalex-snapshot
Then-rea enumeration degrees are dense
inferred← citeshttps://doi.org/10.1007/bf02785966openalex-snapshot
There exists a maximal 3-C.E. enumeration degree
inferred← citeshttps://doi.org/10.1007/bf02808174openalex-snapshot
Branching in the enumeration degrees of the Σ 2 0 sets
inferred← citeshttps://doi.org/10.1007/s00153-002-0161-zopenalex-snapshot
Limit lemmas and jump inversion in the enumeration degrees
inferred← citeshttps://doi.org/10.1007/s00153-004-0245-zopenalex-snapshot
The jump operation for structure degrees
inferred← citeshttps://doi.org/10.1007/s00153-006-0012-4openalex-snapshot
Strong Enumeration Reducibilities
inferred← citeshttps://doi.org/10.1007/s00153-008-0081-7openalex-snapshot
Branching in the $${\Sigma^0_2}$$ -enumeration degrees: a new perspective
inferred← citeshttps://doi.org/10.1007/s00153-009-0171-1openalex-snapshot
The limitations of cupping in the local structure of the enumeration degrees
inferred← citeshttps://doi.org/10.1007/s00153-010-0192-9openalex-snapshot
Goodness in the enumeration and singleton degrees
inferred← citeshttps://doi.org/10.1007/s00153-011-0259-2openalex-snapshot
Bounded enumeration reducibility and its degree structure
inferred← citeshttps://doi.org/10.1007/s00153-012-0268-9openalex-snapshot
Badness and jump inversion in the enumeration degrees
inferred← citeshttps://doi.org/10.1007/s00153-015-0471-6openalex-snapshot
A note on the enumeration degrees of 1-generic sets
inferred← citeshttps://doi.org/10.1007/s00153-021-00766-7openalex-snapshot
The automorphism group and definability of the jump operator in the $$\omega $$-enumeration degrees
inferred← citeshttps://doi.org/10.1007/s001530050064openalex-snapshot
Definability in the enumeration degrees
inferred← citeshttps://doi.org/10.1007/s001530100078openalex-snapshot
Density results in the Δ 2 0 e-degrees
inferred← citeshttps://doi.org/10.1007/s10469-025-09804-2openalex-snapshot
Every Nonzero Enumeration Degree Contains Infinitely Many Singleton Degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90040-kopenalex-snapshot
Weakly semirecursive sets and r.e. orderings
inferred← citeshttps://doi.org/10.1016/j.aim.2021.107686openalex-snapshot
Fragments of the theory of the enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2004.04.010openalex-snapshot
The minimal e-degree problem in fragments of Peano arithmetic
inferred← citeshttps://doi.org/10.1016/j.apal.2008.12.002openalex-snapshot
The structure of the s -degrees contained within a single e -degree
inferred← citeshttps://doi.org/10.1016/j.apal.2009.01.003openalex-snapshot
The jump operator on the ω -enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.012openalex-snapshot
Empty intervals in the enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2014.01.007openalex-snapshot
The automorphism group of the enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2014.04.008openalex-snapshot
Avoiding uniformity in the Δ20 enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.apal.2018.01.001openalex-snapshot
Density of the cototal enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.042openalex-snapshot
Splitting and nonsplitting in the Σ20 enumeration degrees
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80046-7openalex-snapshot
Rigidity and definability in the noncomputable universe
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80020-2openalex-snapshot
Local Degree Theory* *Preparation of this paper partially supported by E.P.S.R.C. research grants nos. GR/H91213 and GR/H02165, and by EC Human Capital and Mobility network ‘Complexity, Logic and Recursion Theory’.
inferred← citeshttps://doi.org/10.1016/s0168-0072(96)00009-7openalex-snapshot
Cupping and noncupping in the enumeration degrees of ∑20 sets
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00076-6openalex-snapshot
Sets of generators and automorphism bases for the enumeration degrees
inferred← citeshttps://doi.org/10.1017/9781316755723.015openalex-snapshot
Ash's theorem for abstract structures
inferred← citeshttps://doi.org/10.1017/9781316756140.006openalex-snapshot
Relative Splittings of in the-Enumeration Degrees
inferred← citeshttps://doi.org/10.1017/9781316756140.013openalex-snapshot
Hartley Rogers’ 1965 Agenda
inferred← citeshttps://doi.org/10.1017/cbo9780511863196.019openalex-snapshot
Oracles, Infinitary Computation, and the Physics of the Mind
inferred← citeshttps://doi.org/10.1017/cbo9780511863196.022openalex-snapshot
On Attempting to Model the Mathematical Mind
inferred← citeshttps://doi.org/10.1017/jsl.2013.1openalex-snapshot
A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES
inferred← citeshttps://doi.org/10.1017/jsl.2014.84openalex-snapshot
INITIAL SEGMENTS OF THE ENUMERATION DEGREES
inferred← citeshttps://doi.org/10.1017/s0960129508007378openalex-snapshot
Cupping Δ20 enumeration degrees to 0e′
inferred← citeshttps://doi.org/10.1023/a:1022660222520openalex-snapshot
Splitting Properties of Total Enumeration Degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-2014-06157-6openalex-snapshot
Definability via Kalimullin pairs in the structure of the enumeration degrees
inferred← citeshttps://doi.org/10.1093/logcom/exq044openalex-snapshot
Non-cuppable enumeration degrees via finite injury
inferred← citeshttps://doi.org/10.1093/logcom/exq048openalex-snapshot
Counting the back-and-forth types
inferred← citeshttps://doi.org/10.1093/logcom/ext041openalex-snapshot
Effective properties of Marker's extensions
inferred← citeshttps://doi.org/10.1093/logcom/ext043openalex-snapshot
Singleton enumeration reducibility and arithmetic
inferred← citeshttps://doi.org/10.1134/s0037446613060177openalex-snapshot
Complements for enumeration Π01-degrees
inferred← citeshttps://doi.org/10.1134/s0037446623010172openalex-snapshot
Enumeration Reducibility and Positive Reducibility of the Numberings of Families of Arithmetic Sets
inferred← citeshttps://doi.org/10.1134/s1055134423030057openalex-snapshot
Positive Reducibilities, Extreme Numberings, and Completeness
inferred← citeshttps://doi.org/10.1142/s0219061303000285openalex-snapshot
DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
inferred← citeshttps://doi.org/10.1201/b21197-8openalex-snapshot
Arithmetic Hierarchy and Enumeration Degrees
inferred← citeshttps://doi.org/10.2178/jsl/1122038912openalex-snapshot
Bounding and nonbounding minimal pairs in the enumeration degrees
inferred← citeshttps://doi.org/10.2178/jsl/1190150096openalex-snapshot
Splitting properties of n-c.e. enumeration degrees
inferred← citeshttps://doi.org/10.2178/jsl/1208359064openalex-snapshot
How enumeration reductibility yields extended Harrington non-splitting
inferred← citeshttps://doi.org/10.2178/jsl/1230396928openalex-snapshot
A characterization of the δ20 hyperhyperimmune sets
inferred← citeshttps://doi.org/10.2178/jsl/1268917493openalex-snapshot
Interpreting true arithmetic in the -enumeration degrees
inferred← citeshttps://doi.org/10.2178/jsl/1294170994openalex-snapshot
On the jump classes of noncuppable enumeration degrees
inferred← citeshttps://doi.org/10.2307/2275821openalex-snapshot
The Π20 enumeration degrees are not dense
inferred← citeshttps://doi.org/10.2307/2586524openalex-snapshot
The distribution of properly Σ20 e-degrees
inferred← citeshttps://doi.org/10.3233/com-170072openalex-snapshot
The jump hierarchy in the enumeration degrees
inferred← citeshttps://doi.org/10.32513/tbilisi/1528768822openalex-snapshot
Undecidability of local structures of $\mathrm{s}$-degrees and $\mathrm{Q}$-degrees
inferred← citeshttps://doi.org/10.48550/arxiv.1006.4939openalex-snapshot
Enumeration Order Equivalency
inferred← citeshttps://doi.org/10.48550/arxiv.1304.5418openalex-snapshot
Universality in symbolic dynamics constrained by Medvedev degrees
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.