On the public citation graph

Degrees of unsolvability associated with classes of formalized theories

0 signed · 53 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.19550010205openalex-snapshot

Creative sets

inferredcites →https://doi.org/10.1007/978-3-540-89107-9_6openalex-snapshot

Grundlagen der Mathematik

inferredcites →https://doi.org/10.1017/s0022481200039815openalex-snapshot

Barkley Rosser. Extensions of some theorems of Gödel and Church. The journal of symbolic logic, vol. 1 (1936), pp. 87–91.

inferredcites →https://doi.org/10.1038/136126a0openalex-snapshot

Grundlagen der Mathematik

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-1953-0058533-7openalex-snapshot

Two Notes on Recursively Enumerable Sets

inferredcites →https://doi.org/10.2307/2266324openalex-snapshot

On axiomatizability within a system

inferredcites →https://doi.org/10.2307/2267689openalex-snapshot

Some theorems on definability and decidability

inferredcites →https://doi.org/10.2307/2267690openalex-snapshot

On reduction to a symmetric relation

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.19600061502openalex-snapshot

Theories with Effectively Inseparable Nuclei

inferred← citeshttps://doi.org/10.1002/malq.19710170148openalex-snapshot

Rekursive Untrennbarkeit Bei Elementaren Theorien

inferred← citeshttps://doi.org/10.1007/978-3-319-16655-1_8openalex-snapshot

A Remark on a Relational Version of Robinson’s Arithmetic Q

inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_22openalex-snapshot

Turing Jumps Through Provability

inferred← citeshttps://doi.org/10.1007/978-3-319-55486-0_13openalex-snapshot

Experimental Logics as a Model of Development of Deductive Science and Computational Properties of Undecidable Sentences

inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3openalex-snapshot

Feferman on Foundations - Logic, Mathematics, Philosophy

inferred← citeshttps://doi.org/10.1007/978-3-662-02460-7openalex-snapshot

Recursively Enumerable Sets and Degrees

inferred← citeshttps://doi.org/10.1007/978-94-010-1138-9_8openalex-snapshot

Interpretability of Elementary Theories

inferred← citeshttps://doi.org/10.1007/bf00972790openalex-snapshot

m-Degrees of the word problem

inferred← citeshttps://doi.org/10.1007/bf01977641openalex-snapshot

Representability op recursively enumerable sets in formal theories

inferred← citeshttps://doi.org/10.1007/bfb0086114openalex-snapshot

Enumeration reducibility, nondeterministic computations and relative computability of partial functions

inferred← citeshttps://doi.org/10.1016/0003-4843(71)90003-9openalex-snapshot

Enumeration reducibility and partial degrees

inferred← citeshttps://doi.org/10.1016/0168-0072(92)90067-aopenalex-snapshot

Myhill's work in recursion 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.tcs.2010.09.004openalex-snapshot

Computational processes, observers and Turing incompleteness

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)70025-9openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71114-5openalex-snapshot

Elements of Recursion Theory

inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70009-6openalex-snapshot

Bibliography

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.1016/s0049-237x(09)70566-xopenalex-snapshot

On a Theorem of Cobham Concerning Undecidable Theories

inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70570-1openalex-snapshot

Some Applications of Degrees

inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80019-6openalex-snapshot

Reducibilities

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/bsl.2020.9openalex-snapshot

FINDING THE LIMIT OF INCOMPLETENESS I

inferred← citeshttps://doi.org/10.1017/bsl.2024.26openalex-snapshot

POUR-EL’S LANDSCAPE

inferred← citeshttps://doi.org/10.1017/cbo9780511779589openalex-snapshot

The Evolution of Logic

inferred← citeshttps://doi.org/10.1070/rm1988v043n02abeh001708openalex-snapshot

Degrees of insolubility of extensions of arithmetic by true propositions

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-1966-0195722-9openalex-snapshot

Some Properties of Pseudo-Complements of Recursively Enumerable Sets

inferred← citeshttps://doi.org/10.1093/jigpal/jzaf012openalex-snapshot

The limitless first incompleteness theorem

inferred← citeshttps://doi.org/10.1093/logcom/exad005openalex-snapshot

There are no minimal essentially undecidable theories

inferred← citeshttps://doi.org/10.1111/j.1746-8361.1970.tb01219.xopenalex-snapshot

A Recursion-Theoretic View of Axiomatizable Theories

inferred← citeshttps://doi.org/10.1201/b21197-9openalex-snapshot

Peano Arithmetic Models and Computability

inferred← citeshttps://doi.org/10.2307/2270052openalex-snapshot

Effectively extensible theories

inferred← citeshttps://doi.org/10.2307/2270853openalex-snapshot

Effectively retractable theories and degrees of undecidability

inferred← citeshttps://doi.org/10.2307/2272413openalex-snapshot

α-degrees of α-theories

inferred← citeshttps://doi.org/10.2307/2964013openalex-snapshot

Degrees of formal systems

inferred← citeshttps://doi.org/10.4204/eptcs.1.22openalex-snapshot

Computational Processes and Incompleteness

inferred← citeshttps://doi.org/10.48550/arxiv.0906.3228openalex-snapshot

Computational Processes and Incompleteness

inferred← citeshttps://doi.org/10.48550/arxiv.1501.05327openalex-snapshot

Turing jumps through provability

inferred← citeshttps://doi.org/10.48550/arxiv.1706.09696openalex-snapshot

On the relation between representations and computability

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.