On the public citation graph

Initial segments of the degrees of size ℵ1

https://doi.org/10.1007/bf02772668
0 signed · 37 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.19680143002openalex-snapshot
Distributive Initial Segments of the Degrees of Unsolvability
inferredcites →https://doi.org/10.1007/978-3-662-21755-9openalex-snapshot
Degrees of Unsolvability
inferredcites →https://doi.org/10.1007/bfb0067135openalex-snapshot
Degrees of Unsolvability: Structure and Theory
inferredcites →https://doi.org/10.1016/0003-4843(80)90004-2openalex-snapshot
Reducibility orderings: Theories, definability and automorphisms
inferredcites →https://doi.org/10.1016/s0049-237x(08)71931-1openalex-snapshot
Initial Segments of the Degrees of Unsolvability Part I: A Survey
inferredcites →https://doi.org/10.1017/s0022481200051343openalex-snapshot
Countable initial segments of the degrees of unsolvability
inferredcites →https://doi.org/10.1073/pnas.76.9.4218openalex-snapshot
The homogeneity conjecture
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-9947-1983-0694377-4openalex-snapshot
Independence Results on the Global Structure of the Turing Degrees
inferredcites →https://doi.org/10.1112/plms/s3-19.1.1openalex-snapshot
Initial Segments of Turing Degrees
inferredcites →https://doi.org/10.2307/1969604openalex-snapshot
On Degrees of Recursive Unsolvability
inferredcites →https://doi.org/10.2307/1969708openalex-snapshot
The Upper Semi-Lattice of Degrees of Recursive Unsolvability
inferredcites →https://doi.org/10.2307/1970779openalex-snapshot
Initial Segments of the Degrees of Unsolvability
inferredcites →https://doi.org/10.2307/1971028openalex-snapshot
First-Order Theory of the Degrees of Recursive Unsolvability
inferredcites →https://doi.org/10.2307/2270693openalex-snapshot
The strong homogeneity conjecture
inferredcites →https://doi.org/10.2307/2274273openalex-snapshot
Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
inferredcites →https://doi.org/10.4153/cjm-1970-064-7openalex-snapshot
Sublattices and Initial Segments of the 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.1007/3-7643-7692-9_14openalex-snapshot
Local Connectedness and Distance Functions
inferred← citeshttps://doi.org/10.1007/bf02765036openalex-snapshot
Initial segments of the degrees of constructibility
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90014-5openalex-snapshot
Lattices of c-degrees
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00060-7openalex-snapshot
Morasses, square and forcing axioms
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90078-topenalex-snapshot
The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory
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.2010.04.002openalex-snapshot
Martin’s Axiom and embeddings of upper semi-lattices into the Turing degrees
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70025-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80019-6openalex-snapshot
Reducibilities
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80021-4openalex-snapshot
The Global Structure of the Turing Degrees
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.012openalex-snapshot
Embeddings into the Turing degrees
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.005openalex-snapshot
Computability theory, algorithmic randomness and Turing's anticipation
inferred← citeshttps://doi.org/10.1090/s0002-9939-2014-11868-5openalex-snapshot
Cofinal maximal chains in the Turing degrees
inferred← citeshttps://doi.org/10.1109/sct.1989.41804openalex-snapshot
The P-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two quantifier theory
inferred← citeshttps://doi.org/10.2178/bsl/1046288724openalex-snapshot
Local Initial Segments of The Turing Degrees
inferred← citeshttps://doi.org/10.2178/bsl/1154698739openalex-snapshot
Degree Structures: Local and Global Investigations
inferred← citeshttps://doi.org/10.2178/jsl/1058448451openalex-snapshot
Embedding jump upper semilattices into the Turing degrees
inferred← citeshttps://doi.org/10.2178/jsl/1203350783openalex-snapshot
Maximal chains in the Turing degrees
inferred← citeshttps://doi.org/10.2178/jsl/1264433911openalex-snapshot
Lattice initial segments of the hyperdegrees
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.