On the public citation graph
Array nonrecursive sets and multiple permitting arguments
0 signed · 92 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.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bf02760850openalex-snapshot
Splitting properties and jump classes
inferredcites →https://doi.org/10.1007/bfb0016275openalex-snapshot
An alternative, priority-free, solution to Post's problem
inferredcites →https://doi.org/10.1007/bfb0059544openalex-snapshot
Embedding nondistributive lattices in the recursively enumerable degrees
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1090/s0002-9947-1968-0220595-7openalex-snapshot
Semirecursive Sets and Positive Reducibility
inferredcites →https://doi.org/10.1090/s0002-9947-1972-0316227-0openalex-snapshot
Π⁰₁ classes and degrees of theories
inferredcites →https://doi.org/10.1090/s0002-9947-1984-0719661-8openalex-snapshot
An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
inferredcites →https://doi.org/10.1090/s0002-9947-1987-0879565-xopenalex-snapshot
T-Degrees, Jump Classes, and Strong Reducibilities
inferredcites →https://doi.org/10.2307/2270510openalex-snapshot
Axiomatizable theories with few axiomatizable extensions
inferredcites →https://doi.org/10.2307/2271653openalex-snapshot
Simplicity of recursively enumerable sets
inferredcites →https://doi.org/10.2307/2272849openalex-snapshot
Minimal pairs and high recursively enumerable degrees
inferredcites →https://doi.org/10.4153/cjm-1972-113-9openalex-snapshot
Degrees in Which the Recursive Sets are Uniformly Recursive
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.200310092openalex-snapshot
Lattice embeddings and array noncomputable degrees
inferred← citeshttps://doi.org/10.1007/11750321_3openalex-snapshot
Totally < ω ω Computably Enumerable and m-topped Degrees
inferred← citeshttps://doi.org/10.1007/11780342_43openalex-snapshot
Degrees of Weakly Computable Reals
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_3openalex-snapshot
Multiple Permitting and Array Noncomputability
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_30openalex-snapshot
A C.E. Weak Truth Table Degree Which Is Array Noncomputable and R-maximal
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_17openalex-snapshot
Lowness for Demuth Randomness
inferred← citeshttps://doi.org/10.1007/bf02762706openalex-snapshot
Lattice embeddings below a nonlow2 recursively enumerable degree
inferred← citeshttps://doi.org/10.1007/s00153-008-0065-7openalex-snapshot
Effectively closed sets and enumerations
inferred← citeshttps://doi.org/10.1007/s00224-012-9424-1openalex-snapshot
Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees
inferred← citeshttps://doi.org/10.1007/s10469-019-09563-xopenalex-snapshot
On Realization of Index Sets in $$ {\prod}_1^0 $$-Classes
inferred← citeshttps://doi.org/10.1007/s11856-022-2331-5openalex-snapshot
Multiple genericity: a new transfinite hierarchy of genericity notions
inferred← citeshttps://doi.org/10.1016/0168-0072(90)90062-7openalex-snapshot
Lattice nonembeddings and initial segments of the recursively enumerable degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90001-topenalex-snapshot
Countable thin Π01 classes
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90234-5openalex-snapshot
Splitting theorems in recursion theory
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/j.apal.2013.10.004openalex-snapshot
The degrees of bi-hyperhyperimmune sets
inferred← citeshttps://doi.org/10.1016/j.apal.2018.04.004openalex-snapshot
Splitting into degrees with low computational strength
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105258openalex-snapshot
Extending CL-reducibility on array noncomputable degrees
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.05.028openalex-snapshot
Turing degrees of reals of positive effective packing dimension
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.05.001openalex-snapshot
Integer valued betting strategies and Turing degrees
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.004openalex-snapshot
Lowness for bounded randomness
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80012-8openalex-snapshot
Chapter 11 A bibliography of recursive algebra and recursive model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80046-3openalex-snapshot
Chapter 13 Π10 classes in mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80048-7openalex-snapshot
Chapter 15 Computable algebras and closure systems: Coding properties
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80018-4openalex-snapshot
∏10 Classes in Computability Theory
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00028-8openalex-snapshot
Embeddings of N5 and the contiguous degrees
inferred← citeshttps://doi.org/10.1017/9781316755907.004openalex-snapshot
Some computability-theoretic aspects of reals and randomness
inferred← citeshttps://doi.org/10.1017/bsl.2017.41openalex-snapshot
A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES
inferred← citeshttps://doi.org/10.1017/jsl.2020.36openalex-snapshot
CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES
inferred← citeshttps://doi.org/10.1017/jsl.2023.26openalex-snapshot
ON THE C.E. DEGREES REALIZABLE IN $\Pi ^0_1$ CLASSES
inferred← citeshttps://doi.org/10.1017/jsl.2023.77openalex-snapshot
NOTES ON SACKS’ SPLITTING THEOREM
inferred← citeshttps://doi.org/10.1090/conm/257/04040openalex-snapshot
Natural definability in degree structures
inferred← citeshttps://doi.org/10.1090/s0002-9947-01-02821-5openalex-snapshot
Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-06-03984-5openalex-snapshot
Invariance in ℰ* and ℰ_{Π}
inferred← citeshttps://doi.org/10.1090/s0002-9947-09-04910-1openalex-snapshot
Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees
inferred← citeshttps://doi.org/10.1109/sct.1995.514733openalex-snapshot
The instance complexity conjecture
inferred← citeshttps://doi.org/10.1137/s0097539794268789openalex-snapshot
Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1142/9789812796554_0004openalex-snapshot
PROMPT SIMPLICITY, ARRAY COMPUTABILITY AND CUPPING
inferred← citeshttps://doi.org/10.1142/9789812796554_0011openalex-snapshot
A CUPPABLE NON-BOUNDING DEGREE
inferred← citeshttps://doi.org/10.1142/9789812796554_0017openalex-snapshot
SOME FUNDAMENTAL ISSUES CONCERNING DEGREES OF UNSOLVABILITY
inferred← citeshttps://doi.org/10.1142/9789814449274_0015openalex-snapshot
Computational aspects of the hyperimmune-free degrees
inferred← citeshttps://doi.org/10.1142/9789819806584_0002openalex-snapshot
Realizing Computably Enumerable Degrees in Separating Classes
inferred← citeshttps://doi.org/10.1142/s0219061307000640openalex-snapshot
TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
inferred← citeshttps://doi.org/10.1142/s0219061307000676openalex-snapshot
DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
inferred← citeshttps://doi.org/10.1142/s0219061318500010openalex-snapshot
Degrees containing members of thin Π10 classes are dense and co-dense
inferred← citeshttps://doi.org/10.1215/00294527-2020-0005openalex-snapshot
Effective Domination and the Bounded Jump
inferred← citeshttps://doi.org/10.2178/bsl/1154698739openalex-snapshot
Degree Structures: Local and Global Investigations
inferred← citeshttps://doi.org/10.2178/bsl/1185803806openalex-snapshot
Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond
inferred← citeshttps://doi.org/10.2178/jsl.7804170openalex-snapshot
Anti-Complex Sets and Reducibilities with Tiny Use
inferred← citeshttps://doi.org/10.2178/jsl/1191333852openalex-snapshot
Π10 classes and strong degree spectra of relations
inferred← citeshttps://doi.org/10.2178/jsl/1327068689openalex-snapshot
Array nonrecursiveness and relative recursive enumerability
inferred← citeshttps://doi.org/10.2178/jsl/1327068690openalex-snapshot
Domination, forcing, array nonrecursiveness and relative recursive enumerability
inferred← citeshttps://doi.org/10.2307/2275754openalex-snapshot
Degree theoretic definitions of the low2 recursively enumerable sets
inferred← citeshttps://doi.org/10.2307/2694972openalex-snapshot
Initial segments of the lattice of Π10 classes
inferred← citeshttps://doi.org/10.26686/wgtn.16985293.v1openalex-snapshot
Randomness and Computability
inferred← citeshttps://doi.org/10.26686/wgtn.17014586.v1openalex-snapshot
Topics in Algorithmic Randomness and Computability Theory
inferred← citeshttps://doi.org/10.3233/com-190269openalex-snapshot
Nonlowness is independent from fickleness
inferred← citeshttps://doi.org/10.3233/com-200297openalex-snapshot
Maximality and collapse in the hierarchy of α -c.a. degrees
inferred← citeshttps://doi.org/10.3233/com-220432openalex-snapshot
Lowness properties for strong reducibilities and the computational power of maximal sets
inferred← citeshttps://doi.org/10.32657/10356/139815openalex-snapshot
Computability theory and degree structures
inferred← citeshttps://doi.org/10.32657/10356/75914openalex-snapshot
On equivalence relations and bounded turing degrees
inferred← citeshttps://doi.org/10.48550/arxiv.1110.0304openalex-snapshot
Anti-complex sets and reducibilities with tiny use
inferred← citeshttps://doi.org/10.48550/arxiv.1505.05298openalex-snapshot
Integer Valued Betting strategies and Turing Degrees
inferred← citeshttps://doi.org/10.48550/arxiv.1906.06381openalex-snapshot
Nonlowness independent from frequent mind changes
inferred← citeshttps://doi.org/10.53733/133openalex-snapshot
Hierarchy of Computably Enumerable Degrees II
inferred← citeshttps://doi.org/10.7274/3r074t66b55openalex-snapshot
A definable relation between c.e. sets and ideals
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.