On the public citation graph
Computing degrees of unsolvability
0 signed · 47 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.1002/malq.19590050703openalex-snapshot
Reducibility and Completeness for Sets of Integers
inferredcites →https://doi.org/10.1016/s0049-237x(09)70461-6openalex-snapshot
On definable sets of positive integers )
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-1944-08111-1openalex-snapshot
Recursively enumerable sets of positive integers and their decision problems
inferredcites →https://doi.org/10.1090/s0002-9939-1954-0063995-6openalex-snapshot
A Theorem on Hypersimple Sets
inferredcites →https://doi.org/10.1090/s0002-9947-1943-0007371-8openalex-snapshot
Recursive Predicates and Quantifiers
inferredcites →https://doi.org/10.1090/s0002-9947-1956-0085187-3openalex-snapshot
Degrees of Computability
inferredcites →https://doi.org/10.1112/plms/s2-42.1.230openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem
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/2268755openalex-snapshot
Arithmetical representation of recursively enumerable sets
inferredcites →https://doi.org/10.2307/2964292openalex-snapshot
Gödel numberings of partial recursive functions
inferredcites →https://doi.org/10.4064/fm-17-1-210-239openalex-snapshot
Sur les ensembles définissables de nombres réels
inferredcites →https://doi.org/10.4064/fm-34-1-81-112openalex-snapshot
On definable sets of positive integers
inferredcites →https://doi.org/10.4064/fm-42-2-259-270openalex-snapshot
Examples of sets definable by means of two and three quantifiers
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.19660120125openalex-snapshot
Classes of Recursively Enumerable Sets and Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1002/malq.19690151302openalex-snapshot
Quantificational variants on the halting problem for turing machines
inferred← citeshttps://doi.org/10.1002/malq.19740200803openalex-snapshot
Some Non‐Recursive Classes of Thue Systems With Solvable Word Problem
inferred← citeshttps://doi.org/10.1002/malq.19760220102openalex-snapshot
Sortability and Extensibility of the Graphs of Recursively Enumerable Partial and Total Orders
inferred← citeshttps://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferred← citeshttps://doi.org/10.1007/bf00969208openalex-snapshot
Calculable enumerations and equivalence relations
inferred← citeshttps://doi.org/10.1007/bf02785966openalex-snapshot
There exists a maximal 3-C.E. enumeration degree
inferred← citeshttps://doi.org/10.1016/0168-0072(89)90018-3openalex-snapshot
Index sets related to prompt simplicity
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00146-8openalex-snapshot
Index sets and presentations of complexity classes
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/s0022-0000(71)80007-7openalex-snapshot
The use of lists in the study of undecidable problemsin automata theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70458-6openalex-snapshot
Thirty Years of Foundational Studies Lectures on the Development of Mathematical Logic and the Study of the Foundations of Mathematics in 1930–1964
inferred← citeshttps://doi.org/10.1017/cbo9781139028073.012openalex-snapshot
Early investigations of the degrees of Borel sets
inferred← citeshttps://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-1962-0140406-2openalex-snapshot
Constructive Analogues of the Group of Permutations of the Natural Numbers
inferred← citeshttps://doi.org/10.1090/s0002-9947-1966-0184855-9openalex-snapshot
On the Degrees of Index Sets
inferred← citeshttps://doi.org/10.1090/s0002-9947-1966-0195722-9openalex-snapshot
Some Properties of Pseudo-Complements of Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1090/s0002-9947-1966-0207562-2openalex-snapshot
The Kleene Hierarchy Classification of Recursively Random Sequences
inferred← citeshttps://doi.org/10.1090/s0002-9947-1967-0213236-5openalex-snapshot
Elementary Differences Between the Isols and the Co-Simple Isols
inferred← citeshttps://doi.org/10.1090/s0002-9947-1969-0241295-4openalex-snapshot
On the Degrees of Index Sets. II
inferred← citeshttps://doi.org/10.1145/321650.321651openalex-snapshot
A Note on Degrees of Self-Describing Turing Machines
inferred← citeshttps://doi.org/10.1201/b21197-9openalex-snapshot
Peano Arithmetic Models and Computability
inferred← citeshttps://doi.org/10.2307/2272557openalex-snapshot
A discrete chain of degrees of index sets
inferred← citeshttps://doi.org/10.2307/2273476openalex-snapshot
Kleene index sets and functional m-degrees
inferred← citeshttps://doi.org/10.7146/math.scand.a-10808openalex-snapshot
On a Problem of J.H.C. Whitehead and a Problem of Alonzo Church.
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.