On the public citation graph

The strong homogeneity conjecture

https://doi.org/10.2307/2270693
0 signed · 30 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.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1112/plms/s3-19.1.1openalex-snapshot
Initial Segments of Turing Degrees
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-94-009-5983-5_2openalex-snapshot
B
inferred← citeshttps://doi.org/10.1007/978-94-009-5994-1_2openalex-snapshot
E
inferred← citeshttps://doi.org/10.1007/bf02772668openalex-snapshot
Initial segments of the degrees of size ℵ1
inferred← citeshttps://doi.org/10.1007/bfb0059550openalex-snapshot
Initial segments and implications for the structure of degrees
inferred← citeshttps://doi.org/10.1007/bfb0090953openalex-snapshot
The degrees of unsolvability: Global results
inferred← citeshttps://doi.org/10.1007/s001530050063openalex-snapshot
Conjectures and questions from Gerald Sacks's Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1007/s10958-021-05426-yopenalex-snapshot
Computable Presentability of Countable Linear Orders
inferred← citeshttps://doi.org/10.1016/0003-4843(80)90004-2openalex-snapshot
Reducibility orderings: Theories, definability and automorphisms
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/s0049-237x(00)80022-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70025-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70956-xopenalex-snapshot
The Structures of Recursion Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71362-4openalex-snapshot
The Turing Degrees and the Metadegrees have Isomorphic Cones*
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80047-5openalex-snapshot
Chapter 14 Computability theory and linear orderings
inferred← citeshttps://doi.org/10.1017/9781316718254.005openalex-snapshot
Definability and global degree theory
inferred← citeshttps://doi.org/10.1017/9781316756140.013openalex-snapshot
Hartley Rogers’ 1965 Agenda
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.005openalex-snapshot
Computability theory, algorithmic randomness and Turing's anticipation
inferred← citeshttps://doi.org/10.1090/proc/13783openalex-snapshot
Cototal enumeration degrees and their applications to effective mathematics
inferred← citeshttps://doi.org/10.1090/s0002-9939-1973-0327494-8openalex-snapshot
Degrees of Nonrecursive Presentability
inferred← citeshttps://doi.org/10.1090/s0002-9939-1994-1203984-4openalex-snapshot
Every Low Boolean Algebra is Isomorphic to a Recursive One
inferred← citeshttps://doi.org/10.1090/s0002-9947-1991-1005933-2openalex-snapshot
Recursive Linear Orders with Incomplete Successivities
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.1142/9789814360548_0004openalex-snapshot
LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
inferred← citeshttps://doi.org/10.1201/b21197-9openalex-snapshot
Peano Arithmetic Models and Computability
inferred← citeshttps://doi.org/10.1215/00294527-2010-006openalex-snapshot
Decidability and Computability of Certain Torsion-Free Abelian Groups
inferred← citeshttps://doi.org/10.2307/1971028openalex-snapshot
First-Order Theory of the Degrees of Recursive Unsolvability
inferred← citeshttps://doi.org/10.2307/2273465openalex-snapshot
Forcing and reductibilities. II. Forcing in fragments of analysis
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.