On the public citation graph

An extension of the recursively enumerable Turing degrees

0 signed · 61 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.200310034openalex-snapshot
A splitting theorem for the Medvedev and Muchnik lattices
inferredcites →https://doi.org/10.1007/978-3-030-11298-1openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/978-3-662-21755-9openalex-snapshot
Degrees of Unsolvability
inferredcites →https://doi.org/10.1007/s00153-003-0195-xopenalex-snapshot
Embeddings into the Medvedev and Muchnik lattices of ? 0 1 classes
inferredcites →https://doi.org/10.1007/s00153-005-0319-6openalex-snapshot
Small Π0 1 Classes
inferredcites →https://doi.org/10.1016/s0019-9958(66)80018-9openalex-snapshot
The definition of random sequences
inferredcites →https://doi.org/10.1016/s0049-237x(08)70045-4openalex-snapshot
Degrees of Functions with no Fixed Points
inferredcites →https://doi.org/10.1016/s0049-237x(99)x8037-2openalex-snapshot
Classical Recursion Theory
inferredcites →https://doi.org/10.1017/s0022481200029728openalex-snapshot
Von Mises' definition of random sequences reconsidered
inferredcites →https://doi.org/10.1017/s0022481200041104openalex-snapshot
Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
inferredcites →https://doi.org/10.1090/pspum/005openalex-snapshot
Recursive Function Theory
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-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1090/s0002-9947-1972-0316227-0openalex-snapshot
Π⁰₁ classes and degrees of theories
inferredcites →https://doi.org/10.1112/jlms/jdp049openalex-snapshot
A fixed-point-free minimal degree
inferredcites →https://doi.org/10.1112/plms/s2-42.1.230openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem
inferredcites →https://doi.org/10.1112/s0024609397244164openalex-snapshot
FINITELY AXIOMATIZABLE THEORIES (Siberian School of Algebra and Logic)
inferredcites →https://doi.org/10.2140/pjm.1972.40.605openalex-snapshot
Degrees of members of Π10classes
inferredcites →https://doi.org/10.2178/bsl/1107959497openalex-snapshot
Mass Problems and Randomness
inferredcites →https://doi.org/10.2178/jsl/1096901775openalex-snapshot
Almost everywhere domination
inferredcites →https://doi.org/10.2307/1970393openalex-snapshot
The Recursively Enumerable Degrees are Dense
inferredcites →https://doi.org/10.2307/2183047openalex-snapshot
Logic, Methodology and Philosophy of Science.
inferredcites →https://doi.org/10.2307/2586708openalex-snapshot
Located sets and reverse mathematics

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.200710013openalex-snapshot
Mass problems and almost everywhere domination
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_9openalex-snapshot
Degrees of Unsolvability: A Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_40openalex-snapshot
Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_12openalex-snapshot
Immunity for Closed Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_6openalex-snapshot
Numberings and Randomness
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_21openalex-snapshot
${\cal P}_w$ Is Not a Heyting Algebra
inferred← citeshttps://doi.org/10.1007/s00153-007-0062-2openalex-snapshot
Embedding FD(ω) into $${\mathcal{P}_s}$$ densely
inferred← citeshttps://doi.org/10.1007/s00153-009-0150-6openalex-snapshot
The ∀∃-theory of the effectively closed Medvedev degrees is decidable
inferred← citeshttps://doi.org/10.1007/s00153-025-00973-6openalex-snapshot
A closed subset of Baire space not Medvedev equivalent to any closed set of Cantor space
inferred← citeshttps://doi.org/10.1007/s00224-014-9546-8openalex-snapshot
Symbolic Dynamics: Entropy = Dimension = Complexity
inferred← citeshttps://doi.org/10.1007/s11856-016-1433-3openalex-snapshot
The weakness of being cohesive, thin or free in reverse mathematics
inferred← citeshttps://doi.org/10.1016/j.apal.2008.06.006openalex-snapshot
The upward closure of a perfect thin class
inferred← citeshttps://doi.org/10.1016/j.apal.2011.10.002openalex-snapshot
Coding true arithmetic in the Medvedev degrees of Π10 classes
inferred← citeshttps://doi.org/10.1016/j.apal.2011.11.003openalex-snapshot
Effectively closed mass problems and intuitionism
inferred← citeshttps://doi.org/10.1016/j.apal.2013.10.006openalex-snapshot
Propagation of partial randomness
inferred← citeshttps://doi.org/10.1016/j.apal.2014.01.003openalex-snapshot
Inside the Muchnik degrees I: Discontinuity, learnability and constructivism
inferred← citeshttps://doi.org/10.1016/j.apal.2014.03.001openalex-snapshot
Inside the Muchnik degrees II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
inferred← citeshttps://doi.org/10.1017/bsl.2016.9openalex-snapshot
DEEP CLASSES
inferred← citeshttps://doi.org/10.1017/etds.2012.152openalex-snapshot
Medvedev degrees of two-dimensional subshifts of finite type
inferred← citeshttps://doi.org/10.1090/btran/134openalex-snapshot
Lawvere-Tierney topologies for computability theorists
inferred← citeshttps://doi.org/10.1090/s0002-9947-10-05037-3openalex-snapshot
On the degree spectrum of a $\Pi ^0_1$ class
inferred← citeshttps://doi.org/10.1093/logcom/exz016openalex-snapshot
Taking the path computably traveled
inferred← citeshttps://doi.org/10.1142/9789812796554_0017openalex-snapshot
SOME FUNDAMENTAL ISSUES CONCERNING DEGREES OF UNSOLVABILITY
inferred← citeshttps://doi.org/10.1142/s0219061307000652openalex-snapshot
MASS PROBLEMS AND HYPERARITHMETICITY
inferred← citeshttps://doi.org/10.1142/s0219061316500069openalex-snapshot
Mass problems and density
inferred← citeshttps://doi.org/10.1215/00294527-2008-002openalex-snapshot
Mass Problems and Intuitionism
inferred← citeshttps://doi.org/10.1215/00294527-2008-009openalex-snapshot
Classifying the Branching Degrees in the Medvedev Lattice of Π 1 0 Classes
inferred← citeshttps://doi.org/10.2178/bsl/1255526079openalex-snapshot
Mass Problems and Measure-Theoretic Regularity
inferred← citeshttps://doi.org/10.2178/bsl/1333560805openalex-snapshot
A Survey of Mučnik and Medvedev Degrees
inferred← citeshttps://doi.org/10.2178/jsl.7803150openalex-snapshot
Diagonally Non-Computable Functions and Bi-Immunity
inferred← citeshttps://doi.org/10.2748/tmj/1325886278openalex-snapshot
Mass problems associated with effectively closed sets
inferred← citeshttps://doi.org/10.3233/com-160055openalex-snapshot
Randomness and degree theory for infinite time register machines1
inferred← citeshttps://doi.org/10.3233/com-160061openalex-snapshot
Infinite time recognizability from generic oracles and the recognizable jump operator
inferred← citeshttps://doi.org/10.32513/tbilisi/1528768843openalex-snapshot
Immunity and Non-Cupping for Closed Sets
inferred← citeshttps://doi.org/10.48550/arxiv.1007.2376openalex-snapshot
A Survey of Muchnik and Medvedev degrees
inferred← citeshttps://doi.org/10.48550/arxiv.1905.12199openalex-snapshot
Taking the path computably travelled
inferred← citeshttps://doi.org/10.48550/arxiv.2204.11289openalex-snapshot
Complexity and Avoidance
inferred← citeshttps://doi.org/10.7274/8336h130p3copenalex-snapshot
Arithmetical Knowledge and Arithmetical Definability: Four Studies
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.