On the public citation graph

Computability Theory and Its Applications

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.
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.1007/bf02837844openalex-snapshot
On the existence of a finite invariant measure
inferredcites →https://doi.org/10.1017/cbo9781139519694.015openalex-snapshot
Definable functions on degrees
inferredcites →https://doi.org/10.1090/s0002-9939-1988-0928981-2openalex-snapshot
An Equivalence Relation that is not Freely Generated
inferredcites →https://doi.org/10.1090/s0002-9947-1977-0578656-4openalex-snapshot
Ergodic Equivalence Relations, Cohomology, and Von Neumann Algebras. I
inferredcites →https://doi.org/10.1090/s0002-9947-1994-1149121-0openalex-snapshot
The Structure of Hyperfinite Borel Equivalence Relations
inferredcites →https://doi.org/10.2307/1970381openalex-snapshot
Transformation Groups and C ∗ -algebras
inferredcites →https://doi.org/10.2307/1990906openalex-snapshot
A Glimm-Effros Dichotomy for Borel Equivalence Relations
inferredcites →https://doi.org/10.2307/2274913openalex-snapshot
Amenable equivalence relations and Turing degrees
inferredcites →https://doi.org/10.2307/421088openalex-snapshot
New Directions in Descriptive Set Theory
inferredcites →https://doi.org/10.4064/fm167-3-1openalex-snapshot
Conjugacy equivalence relation on subgroups

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11494645_35openalex-snapshot
The Low Splitting Theorem in the Difference Hierarchy
inferred← citeshttps://doi.org/10.1007/11750321_3openalex-snapshot
Totally < ω ω Computably Enumerable and m-topped Degrees
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_28openalex-snapshot
Randomness and Reductibility
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_47openalex-snapshot
On the Construction of Effective Random Sets
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_2openalex-snapshot
Computability and Numberings
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_37openalex-snapshot
On a Question of Frank Stephan
inferred← citeshttps://doi.org/10.1007/978-94-017-0395-6_19openalex-snapshot
Synchrony and Composition: Toward a Cognitive Architecture between Classicism and Connectionism
inferred← citeshttps://doi.org/10.1007/s00153-006-0013-3openalex-snapshot
$$\Pi^0_1$$ -Presentations of Algebras
inferred← citeshttps://doi.org/10.1007/s00153-007-0046-2openalex-snapshot
On the definable ideal generated by the plus cupping c.e. degrees
inferred← citeshttps://doi.org/10.1007/s10958-014-2148-9openalex-snapshot
Δ 2 0 -Categoricity of Boolean Algebras
inferred← citeshttps://doi.org/10.1007/s11202-009-0038-zopenalex-snapshot
A certain reducibility on admissible sets
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/j.aim.2004.10.006openalex-snapshot
Lowness properties and randomness
inferred← citeshttps://doi.org/10.1016/j.aim.2017.12.011openalex-snapshot
Computable torsion abelian groups
inferred← citeshttps://doi.org/10.1016/j.apal.2007.03.003openalex-snapshot
On definable filters in computably enumerable degrees
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.2012.11.006openalex-snapshot
Reverse-engineering Reverse Mathematics
inferred← citeshttps://doi.org/10.1016/j.jal.2015.04.001openalex-snapshot
On classifying abduction
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.041openalex-snapshot
Inductive inference and computable numberings
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.029openalex-snapshot
Algebraic structures computable without delay
inferred← citeshttps://doi.org/10.1017/s0960129516000244openalex-snapshot
Splitting and non-splitting in the difference hierarchy
inferred← citeshttps://doi.org/10.1017/s1755020316000411openalex-snapshot
THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
inferred← citeshttps://doi.org/10.1093/logcom/exq047openalex-snapshot
Properties of the jump classes
inferred← citeshttps://doi.org/10.1142/s0218196705002281openalex-snapshot
COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS
inferred← citeshttps://doi.org/10.1142/s0219061318500101openalex-snapshot
There is no classification of the decidably presentable structures
inferred← citeshttps://doi.org/10.2178/bsl/1154698739openalex-snapshot
Degree Structures: Local and Global Investigations
inferred← citeshttps://doi.org/10.2178/jsl.7802130openalex-snapshot
Probabilistic Algorithmic Randomness
inferred← citeshttps://doi.org/10.2307/2687773openalex-snapshot
The Prospects for Mathematical Logic in the Twenty-First Century
inferred← citeshttps://doi.org/10.2307/2695101openalex-snapshot
Computational randomness and lowness
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.