On the public citation graph
Mass problems and almost everywhere domination
0 signed · 39 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.200710012openalex-snapshot
Almost everywhere domination and superhighness
inferredcites →https://doi.org/10.1007/bfb0016229openalex-snapshot
Mathematical Foundations of Computer Science 1986
inferredcites →https://doi.org/10.1007/bfb0016275openalex-snapshot
An alternative, priority-free, solution to Post's problem
inferredcites →https://doi.org/10.1007/bfb0076224openalex-snapshot
Measure, Π 1 0 -classes and complete extensions of PA
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.1016/j.aim.2004.10.006openalex-snapshot
Lowness properties and randomness
inferredcites →https://doi.org/10.1016/s0049-237x(08)70045-4openalex-snapshot
Degrees of Functions with no Fixed Points
inferredcites →https://doi.org/10.1090/pspum/005/0141595openalex-snapshot
Algebras of sets binumerable in complete extensions of arithmetic
inferredcites →https://doi.org/10.1090/s0002-9939-07-08648-0openalex-snapshot
Low for random reals and positive-measure domination
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-1983-0682720-1openalex-snapshot
Pseudo Jump Operators. I: The R. E. Case
inferredcites →https://doi.org/10.1112/jlms/jdl015openalex-snapshot
An extension of the recursively enumerable Turing degrees
inferredcites →https://doi.org/10.1142/9789812796554_0017openalex-snapshot
SOME FUNDAMENTAL ISSUES CONCERNING DEGREES OF UNSOLVABILITY
inferredcites →https://doi.org/10.1142/s0219061307000652openalex-snapshot
MASS PROBLEMS AND HYPERARITHMETICITY
inferredcites →https://doi.org/10.2178/jsl/1140641165openalex-snapshot
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
inferredcites →https://doi.org/10.2178/jsl/1154698592openalex-snapshot
Uniform almost everywhere domination
inferredcites →https://doi.org/10.2307/1996261openalex-snapshot
∏ 0 1 Classes and Degrees of Theories
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.200710012openalex-snapshot
Almost everywhere domination and superhighness
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_9openalex-snapshot
Degrees of Unsolvability: A Tutorial
inferred← citeshttps://doi.org/10.1007/s00153-007-0062-2openalex-snapshot
Embedding FD(ω) into $${\mathcal{P}_s}$$ densely
inferred← citeshttps://doi.org/10.1016/j.apal.2011.01.004openalex-snapshot
Demuth randomness and computational complexity
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105028openalex-snapshot
Continuous randomness via transformations of 2-random sequences
inferred← citeshttps://doi.org/10.1017/etds.2012.152openalex-snapshot
Medvedev degrees of two-dimensional subshifts of finite type
inferred← citeshttps://doi.org/10.1142/s0219061307000652openalex-snapshot
MASS PROBLEMS AND HYPERARITHMETICITY
inferred← citeshttps://doi.org/10.1215/00294527-2008-002openalex-snapshot
Mass Problems and Intuitionism
inferred← citeshttps://doi.org/10.2178/bsl/1255526079openalex-snapshot
Mass Problems and Measure-Theoretic Regularity
inferred← citeshttps://doi.org/10.2178/jsl/1294171001openalex-snapshot
Benign cost functions and lowness properties
inferred← citeshttps://doi.org/10.2748/tmj/1325886278openalex-snapshot
Mass problems associated with effectively closed sets
inferred← citeshttps://doi.org/10.4171/jems/602openalex-snapshot
Coherent randomness tests and computing the $K$-trivial sets
inferred← citeshttps://doi.org/10.48550/arxiv.1012.3427openalex-snapshot
Harrington's Solution to McLaughlin's Conjecture and Non-uniform Self-moduli
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.