On the public citation graph

Degrees joining to 0′

0 signed · 90 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.19680140704openalex-snapshot

The Degrees of Hyperimmune Sets

inferredcites →https://doi.org/10.1016/s0049-237x(08)x7075-2openalex-snapshot

Sets, Models and Recursion Theory

inferredcites →https://doi.org/10.1016/s0304-0208(08)x7131-2openalex-snapshot

Degrees of Unsolvability

inferredcites →https://doi.org/10.1090/s0002-9904-1949-09302-3openalex-snapshot

Memoirs of the American Mathematical Society

inferredcites →https://doi.org/10.2307/2269688openalex-snapshot

A theorem on minimal degrees

inferredcites →https://doi.org/10.2307/2270695openalex-snapshot

A cornucopia of minimal degrees

inferredcites →https://doi.org/10.2307/2272061openalex-snapshot

Minimal degrees and the jump operator

inferredcites →https://doi.org/10.2307/2273510openalex-snapshot

Double jumps of minimal degrees

inferredcites →https://doi.org/10.2307/2964177openalex-snapshot

A criterion for completeness of degrees of unsolvability

inferredcites →https://doi.org/10.4153/cjm-1972-113-9openalex-snapshot

Degrees in Which the Recursive Sets are Uniformly Recursive

inferredcites →https://doi.org/10.4153/cjm-1977-105-5openalex-snapshot

Simple Proofs of Some Theorems on High Degrees of Unsolvability

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.19930390153openalex-snapshot

A cohesive set which is not high

inferred← citeshttps://doi.org/10.1002/malq.200310089openalex-snapshot

Quasi‐complements of the cappable degrees

inferred← citeshttps://doi.org/10.1002/malq.200410044openalex-snapshot

The minimal complementation property above 0′

inferred← citeshttps://doi.org/10.1002/malq.200710012openalex-snapshot

Almost everywhere domination and superhighness

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-642-13962-8_30openalex-snapshot

Degrees with Almost Universal Cupping Property

inferred← citeshttps://doi.org/10.1007/bf02761906openalex-snapshot

Automorphism bases for degrees of unsolvability

inferred← citeshttps://doi.org/10.1007/bfb0076224openalex-snapshot

Measure, Π 1 0 -classes and complete extensions of PA

inferred← citeshttps://doi.org/10.1007/bfb0076225openalex-snapshot

On the ordering of classes in high/low hierarchies

inferred← citeshttps://doi.org/10.1007/bfb0084969openalex-snapshot

Definable functions on degrees

inferred← citeshttps://doi.org/10.1007/bfb0099479openalex-snapshot

Minimal degrees and 1-generic sets below 0′

inferred← citeshttps://doi.org/10.1007/s00153-004-0215-5openalex-snapshot

Finite cupping sets

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-014-0393-8openalex-snapshot

Natural factors of the Medvedev lattice capturing IPC

inferred← citeshttps://doi.org/10.1016/0168-0072(85)90001-6openalex-snapshot

Upper bounds for the arithmetical degrees

inferred← citeshttps://doi.org/10.1016/0168-0072(86)90068-0openalex-snapshot

1-Generic degrees and minimal degrees in higher recursion theory, II

inferred← citeshttps://doi.org/10.1016/0168-0072(87)90039-xopenalex-snapshot

Complementing below recursively enumerable degrees

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.2005.10.004openalex-snapshot

Bounding computably enumerable degrees in the Ershov hierarchy

inferred← citeshttps://doi.org/10.1016/j.apal.2013.06.001openalex-snapshot

Natural factors of the Muchnik lattice capturing IPC

inferred← citeshttps://doi.org/10.1016/j.apal.2014.04.017openalex-snapshot

The ω-Turing degrees

inferred← citeshttps://doi.org/10.1016/j.apal.2015.03.001openalex-snapshot

Cone avoidance and randomness preservation

inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70655-xopenalex-snapshot

On the Role of O' in Recursion Theory

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)00077-8openalex-snapshot

Learning via queries and oracles

inferred← citeshttps://doi.org/10.1017/9781316718254.005openalex-snapshot

Definability and global degree theory

inferred← citeshttps://doi.org/10.1017/9781316755884.016openalex-snapshot

Aspects of the Turing jump

inferred← citeshttps://doi.org/10.1017/cbo9780511605321.012openalex-snapshot

Embeddings into the Turing degrees

inferred← citeshttps://doi.org/10.1017/cbo9780511605321.013openalex-snapshot

Randomness—beyond Lebesgue measure

inferred← citeshttps://doi.org/10.1017/fms.2017.27openalex-snapshot

HIGHER RANDOMNESS AND GENERICITY

inferred← citeshttps://doi.org/10.1017/jsl.2015.15openalex-snapshot

AXIOM I0 AND HIGHER DEGREE THEORY

inferred← citeshttps://doi.org/10.1017/s0960129519000021openalex-snapshot

Definability in the local structure of the ω-Turing degrees

inferred← citeshttps://doi.org/10.1090/jams/980openalex-snapshot

Effective randomness for continuous measures

inferred← citeshttps://doi.org/10.1090/s0002-9939-2011-10908-0openalex-snapshot

A note on the join property

inferred← citeshttps://doi.org/10.1090/s0002-9939-2014-11997-6openalex-snapshot

Cupping with random sets

inferred← citeshttps://doi.org/10.1090/s0002-9947-04-03585-8openalex-snapshot

A join theorem for the computably enumerable degrees

inferred← citeshttps://doi.org/10.1090/s0002-9947-07-04331-0openalex-snapshot

A single minimal complement for the c.e. degrees

inferred← citeshttps://doi.org/10.1090/s0002-9947-1988-0973174-0openalex-snapshot

Decidability and Invariant Classes for Degree Structures

inferred← citeshttps://doi.org/10.1090/s0002-9947-2012-05660-1openalex-snapshot

Extensions of embeddings below computably enumerable degrees

inferred← citeshttps://doi.org/10.1090/s0002-9947-2015-06184-4openalex-snapshot

Measures and their random reals

inferred← citeshttps://doi.org/10.1090/s0273-0979-1990-15923-3openalex-snapshot

The jump is definable in the structure of the degrees of unsolvability

inferred← citeshttps://doi.org/10.1090/tran/6881openalex-snapshot

Measure-theoretic applications of higher Demuth’s Theorem

inferred← citeshttps://doi.org/10.1112/plms/pdt065openalex-snapshot

The typical Turing degree

inferred← citeshttps://doi.org/10.1134/s0037446613060177openalex-snapshot

Complements for enumeration Π01-degrees

inferred← citeshttps://doi.org/10.1142/9789812794055_0002openalex-snapshot

GLOBAL PROPERTIES OF THE TURING DEGREES AND THE TURING JUMP

inferred← citeshttps://doi.org/10.1142/9789814449274_0004openalex-snapshot

Limits to joining with generics and randoms

inferred← citeshttps://doi.org/10.1142/9789814678001_0012openalex-snapshot

Large Cardinals and Higher Degree Theory

inferred← citeshttps://doi.org/10.1142/9789819806584_0005openalex-snapshot

Turing Degrees of Hyperjumps

inferred← citeshttps://doi.org/10.1142/s0219061303000285openalex-snapshot

DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES

inferred← citeshttps://doi.org/10.1142/s0219061316500021openalex-snapshot

On notions of computability-theoretic reduction between Π21 principles

inferred← citeshttps://doi.org/10.1145/168304.168319openalex-snapshot

On the structure of degrees of inferability

inferred← citeshttps://doi.org/10.1145/225298.225317openalex-snapshot

Learning via queries and oracles

inferred← citeshttps://doi.org/10.1215/00294527-2008-002openalex-snapshot

Mass Problems and Intuitionism

inferred← citeshttps://doi.org/10.1215/00294527-2017-0021openalex-snapshot

Two More Characterizations of K-Triviality

inferred← citeshttps://doi.org/10.1305/ndjfl/1187031408openalex-snapshot

Cuppability of Simple and Hypersimple Sets

inferred← citeshttps://doi.org/10.2178/jsl/1102022208openalex-snapshot

Minimal complements for degrees below 0′

inferred← citeshttps://doi.org/10.2178/jsl/1102022219openalex-snapshot

Generalized high degrees have the complementation property

inferred← citeshttps://doi.org/10.2178/jsl/1154698592openalex-snapshot

Uniform almost everywhere domination

inferred← citeshttps://doi.org/10.2178/jsl/1208359064openalex-snapshot

How enumeration reductibility yields extended Harrington non-splitting

inferred← citeshttps://doi.org/10.2178/jsl/1245158095openalex-snapshot

Bounding non-GL2 and R.E.A.

inferred← citeshttps://doi.org/10.2307/2273465openalex-snapshot

Forcing and reductibilities. II. Forcing in fragments of analysis

inferred← citeshttps://doi.org/10.2307/2274273openalex-snapshot

Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers

inferred← citeshttps://doi.org/10.2307/2274867openalex-snapshot

The strong anticupping property for recursively enumerable degrees

inferred← citeshttps://doi.org/10.2307/2275022openalex-snapshot

Complementation in the Turing degrees

inferred← citeshttps://doi.org/10.2307/2275404openalex-snapshot

Minimal upper bounds for arithmetical degrees

inferred← citeshttps://doi.org/10.2307/2694910openalex-snapshot

On the strength of Ramsey's theorem for pairs

inferred← citeshttps://doi.org/10.2748/tmj/1325886278openalex-snapshot

Mass problems associated with effectively closed sets

inferred← citeshttps://doi.org/10.3233/com-170068openalex-snapshot

The search for natural definability in the Turing degrees

inferred← citeshttps://doi.org/10.4064/fm27-12-2015openalex-snapshot

The strength of Turing determinacy within second order arithmetic

inferred← citeshttps://doi.org/10.4099/math1924.13.381openalex-snapshot

1-Generic degrees and minimal degrees in higher recursion theory

inferred← citeshttps://doi.org/10.48550/arxiv.0707.1390openalex-snapshot

Probability Measures and Effective Randomness

inferred← citeshttps://doi.org/10.48550/arxiv.0802.2705openalex-snapshot

Measures and their random reals

inferred← citeshttps://doi.org/10.48550/arxiv.1111.1064openalex-snapshot

The typical Turing degree

inferred← citeshttps://doi.org/10.48550/arxiv.1206.1603openalex-snapshot

Cupping with random sets

inferred← citeshttps://doi.org/10.48550/arxiv.1209.3282openalex-snapshot

Limits to joining with generics and randoms

inferred← citeshttps://doi.org/10.48550/arxiv.1210.6538openalex-snapshot

Natural Factors of the Muchnik Lattice Capturing IPC

inferred← citeshttps://doi.org/10.48550/arxiv.1706.09696openalex-snapshot

On the relation between representations and computability

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.