On the public citation graph

Degrees of Unsolvability: Structure and Theory

https://doi.org/10.1007/bfb0067135
0 signed · 55 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/malq.19870330608openalex-snapshot
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
inferred← citeshttps://doi.org/10.1002/malq.19960420116openalex-snapshot
Strong Minimal Covers for Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.1002/malq.200310110openalex-snapshot
Weak computability and representation of reals
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_48openalex-snapshot
About the by codings of environments induced posets [µ z, ≤] and [ℒz, ≤]
inferred← citeshttps://doi.org/10.1007/978-1-4613-0609-2_18openalex-snapshot
Pemarks on Denjoy Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-08019-2_12openalex-snapshot
Learnability Thesis Does Not Entail Church’s Thesis
inferred← citeshttps://doi.org/10.1007/978-3-662-55386-2_19openalex-snapshot
Concrete Mathematics. Finitistic Approach to Foundations
inferred← citeshttps://doi.org/10.1007/bf01620618openalex-snapshot
Bounded query classes and the difference hierarchy
inferred← citeshttps://doi.org/10.1007/bf02772668openalex-snapshot
Initial segments of the degrees of size ℵ1
inferred← citeshttps://doi.org/10.1007/bfb0076222openalex-snapshot
Genericity for recursively enumerable sets
inferred← citeshttps://doi.org/10.1007/bfb0076227openalex-snapshot
The structure of m-degrees
inferred← citeshttps://doi.org/10.1007/bfb0090244openalex-snapshot
Trees and degrees
inferred← citeshttps://doi.org/10.1007/bfb0090937openalex-snapshot
Hierarchies of sets and degrees below 0′
inferred← citeshttps://doi.org/10.1007/bfb0090953openalex-snapshot
The degrees of unsolvability: Global results
inferred← citeshttps://doi.org/10.1007/s001530050067openalex-snapshot
Iterated trees of strategies and priority arguments
inferred← citeshttps://doi.org/10.1007/s10958-021-05418-yopenalex-snapshot
Turing Computability: Structural Theory
inferred← citeshttps://doi.org/10.1016/0003-4843(80)90004-2openalex-snapshot
Reducibility orderings: Theories, definability and automorphisms
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90027-2openalex-snapshot
A low and a high hierarchy within NP
inferred← citeshttps://doi.org/10.1016/0165-4896(88)90002-9openalex-snapshot
Lower bounds on degrees of game-theoretic structures
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/s0049-237x(06)80045-5openalex-snapshot
Contributions to the history of variations of weak density in the n-R.E. Degrees
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80046-7openalex-snapshot
Rigidity and definability in the noncomputable universe
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71887-1openalex-snapshot
Degrees of Models of True Arithmetic
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70513-0openalex-snapshot
The Turing and Truth-Table-Degrees are not Elementarily Equivalent
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.1017/9781316718254.005openalex-snapshot
Definability and global degree theory
inferred← citeshttps://doi.org/10.1017/cbo9781139519694.014openalex-snapshot
Trees and degrees
inferred← citeshttps://doi.org/10.1090/proc/12808openalex-snapshot
Computably enumerable Turing degrees and the meet property
inferred← citeshttps://doi.org/10.1090/s0002-9939-01-06015-4openalex-snapshot
A splitting theorem for 𝑛-𝑅𝐸𝐴 degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-03-03406-8openalex-snapshot
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
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/s0273-0979-1990-15923-3openalex-snapshot
The jump is definable in the structure of the degrees of unsolvability
inferred← citeshttps://doi.org/10.1109/icips.1997.669169openalex-snapshot
Sequence of knowledge bases and evaluating revision approximately
inferred← citeshttps://doi.org/10.1109/sct.1991.160245openalex-snapshot
Bounded queries in recursion theory: a survey
inferred← citeshttps://doi.org/10.1112/jlms/s2-24.1.1openalex-snapshot
The Theory of the Degrees below 0 ′
inferred← citeshttps://doi.org/10.1142/s0219061312500055openalex-snapshot
THE n-r.e. DEGREES: UNDECIDABILITY AND Σ1 SUBSTRUCTURES
inferred← citeshttps://doi.org/10.1201/b21197-9openalex-snapshot
Peano Arithmetic Models and Computability
inferred← citeshttps://doi.org/10.2178/bsl/1154698739openalex-snapshot
Degree Structures: Local and Global Investigations
inferred← citeshttps://doi.org/10.2178/jsl/1045861506openalex-snapshot
On a problem of Cooper and Epstein
inferred← citeshttps://doi.org/10.2178/jsl/1286198150openalex-snapshot
A high c.e. degree which is not the join of two minimal degrees
inferred← citeshttps://doi.org/10.2307/2273666openalex-snapshot
Forcing and reducibilities. III. Forcing in fragments of set theory
inferred← citeshttps://doi.org/10.2307/2274174openalex-snapshot
Two theorems on degrees of models of true arithmetic
inferred← citeshttps://doi.org/10.2307/2274181openalex-snapshot
Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
inferred← citeshttps://doi.org/10.2307/2274313openalex-snapshot
On the T-degrees of partial functions
inferred← citeshttps://doi.org/10.2307/2274335openalex-snapshot
Jumps of quasi-minimal enumeration degrees
inferred← citeshttps://doi.org/10.2307/2274661openalex-snapshot
A 1-generic degree which bounds a minimal degree
inferred← citeshttps://doi.org/10.2307/2274739openalex-snapshot
A cardinality version of Beigel's nonspeedup theorem
inferred← citeshttps://doi.org/10.2307/2275452openalex-snapshot
The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility
inferred← citeshttps://doi.org/10.2307/2275695openalex-snapshot
Boolean algebras, Stone spaces, and the iterated Turing jump
inferred← citeshttps://doi.org/10.2307/2586653openalex-snapshot
Bounding minimal degrees by computably enumerable degrees
inferred← citeshttps://doi.org/10.3217/jucs-003-03-0172openalex-snapshot
Difference Splittings of Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.32657/10356/46540openalex-snapshot
Contributions to degree structures
inferred← citeshttps://doi.org/10.32657/10356/48687openalex-snapshot
Local structure theory and the Ershov hierarchy
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2022.8openalex-snapshot
Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order
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.