On the public citation graph
Measure-theoretic construction of incomparable hyperdegrees
0 signed · 41 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.1073/pnas.24.12.556openalex-snapshot
The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis
inferredcites →https://doi.org/10.1073/pnas.43.2.236openalex-snapshot
TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
inferredcites →https://doi.org/10.1090/s0002-9904-1955-09896-3openalex-snapshot
Hierarchies of number-theoretic predicates
inferredcites →https://doi.org/10.1090/s0002-9939-1957-0091243-2openalex-snapshot
A Note on Function Quantification
inferredcites →https://doi.org/10.1090/s0002-9947-1955-0070594-4openalex-snapshot
Arithmetical Predicates and Function Quantifiers
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/2964177openalex-snapshot
A criterion for completeness of 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/978-3-319-22156-4_8openalex-snapshot
The Information Content of Typical Reals
inferred← citeshttps://doi.org/10.1007/978-3-642-86745-3_6openalex-snapshot
Measure-Theoretic Uniformity
inferred← citeshttps://doi.org/10.1007/978-3-662-12898-5openalex-snapshot
Recursion-Theoretic Hierarchies
inferred← citeshttps://doi.org/10.1007/978-94-017-0938-5_2openalex-snapshot
Boolean Constructions in Universal Algebras
inferred← citeshttps://doi.org/10.1007/bf01879734openalex-snapshot
The finitary independence of epimorphism and embedding relations
inferred← citeshttps://doi.org/10.1007/bf01979200openalex-snapshot
Countable embeddability skeletons of discriminator varieties
inferred← citeshttps://doi.org/10.1007/bf02757880openalex-snapshot
Some measure theoretic results in effective descriptive set theory
inferred← citeshttps://doi.org/10.1007/s00153-005-0283-1openalex-snapshot
Bounded truth table does not reduce the one-query tautologies to a random oracle
inferred← citeshttps://doi.org/10.1007/s10992-020-09565-6openalex-snapshot
A System of Axioms for Minkowski Spacetime
inferred← citeshttps://doi.org/10.1016/0003-4843(73)90012-0openalex-snapshot
Measure and category in effective descriptive set theory
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/b978-0-7204-2233-7.50054-xopenalex-snapshot
A BIBLIOGRAPHY OF THE THEORY OF MODELS
inferred← citeshttps://doi.org/10.1016/j.aim.2012.12.018openalex-snapshot
Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70601-3openalex-snapshot
An Uncritical Bibliography of Papers on Generalized Recursion Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71955-4openalex-snapshot
Analytical Wellorderings in R
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70570-1openalex-snapshot
Some Applications of Degrees
inferred← citeshttps://doi.org/10.1017/s1755020324000297openalex-snapshot
THE GENERIC MULTIVERSE IS NOT GOING AWAY
inferred← citeshttps://doi.org/10.1090/memo/1135openalex-snapshot
Classes of Polish spaces under effective Borel isomorphism
inferred← citeshttps://doi.org/10.1090/s0002-9904-1964-11104-6openalex-snapshot
A complete classification of the Δ₂¹-functions
inferred← citeshttps://doi.org/10.1090/s0002-9904-1967-11701-4openalex-snapshot
Measure-theoretic uniformity
inferred← citeshttps://doi.org/10.1090/s0002-9947-1968-0244049-7openalex-snapshot
Recursive Pseudo-Well-Orderings
inferred← citeshttps://doi.org/10.1090/s0002-9947-1969-0253895-6openalex-snapshot
Measure-theoretic uniformity in recursion theory and set theory
inferred← citeshttps://doi.org/10.1090/tran/6881openalex-snapshot
Measure-theoretic applications of higher Demuth’s Theorem
inferred← citeshttps://doi.org/10.1134/s003744661103013xopenalex-snapshot
Conditional geometric scales of discriminator varieties
inferred← citeshttps://doi.org/10.11429/sugaku1947.48.372openalex-snapshot
数学基礎論的手法の計算量理論への応用(付 : 数学他分野との関連)
inferred← citeshttps://doi.org/10.2140/pjm.1961.11.1479openalex-snapshot
Category methods in recursion theory
inferred← citeshttps://doi.org/10.2307/1995364openalex-snapshot
Measure-Theoretic Uniformity in Recursion Theory and Set Theory
inferred← citeshttps://doi.org/10.2307/2272735openalex-snapshot
Decidability of the “almost all” theory of degrees
inferred← citeshttps://doi.org/10.48550/arxiv.1109.6752openalex-snapshot
Pseudo-jump inversion and SJT-hard sets
inferred← citeshttps://doi.org/10.48550/arxiv.1701.03735openalex-snapshot
Classes of Polish spaces under effective Borel isomorphism
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.