On the public citation graph

Degrees of formal systems

https://doi.org/10.2307/2964013
0 signed · 31 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.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2307/2266324openalex-snapshot
On axiomatizability within a system
inferredcites →https://doi.org/10.2307/2964178openalex-snapshot
Degrees of unsolvability associated with classes of formalized theories
inferredcites →https://doi.org/10.4064/fm-40-1-131-139openalex-snapshot
Undecidability of some simple formalized theories

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-94-009-2356-0_15openalex-snapshot
Computers and Mathematical Activity
inferred← citeshttps://doi.org/10.1007/bf01974157openalex-snapshot
Representability of recursively enumerable sets in formal theories
inferred← citeshttps://doi.org/10.1007/bf01977641openalex-snapshot
Representability op recursively enumerable sets in formal theories
inferred← citeshttps://doi.org/10.1007/s00153-022-00820-yopenalex-snapshot
Weak essentially undecidable theories of concatenation
inferred← citeshttps://doi.org/10.1007/s00153-024-00911-yopenalex-snapshot
Essential hereditary undecidability
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.apal.2022.103160openalex-snapshot
Friedman-reflexivity
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)71695-1openalex-snapshot
Remarks on Machines, Sets, and the Decision Problem
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(98)80001-3openalex-snapshot
Introduction to the handbook of Recursive Mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80012-8openalex-snapshot
Chapter 11 A bibliography of recursive algebra and recursive model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80045-1openalex-snapshot
Introduction to the handbook of recursive mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80046-3openalex-snapshot
Chapter 13 Π10 classes in mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80018-4openalex-snapshot
∏10 Classes in Computability Theory
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00052-3openalex-snapshot
Index sets for Π01 classes
inferred← citeshttps://doi.org/10.1017/bsl.2020.9openalex-snapshot
FINDING THE LIMIT OF INCOMPLETENESS I
inferred← citeshttps://doi.org/10.1093/jigpal/jzad015openalex-snapshot
On the relationships between some meta-mathematical properties of arithmetical theories
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.1093/logcom/exad023openalex-snapshot
Effective inseparability and some applications in meta-mathematics
inferred← citeshttps://doi.org/10.1109/sfcs.1984.715952openalex-snapshot
Complexity Measures For Public-Key Cryptosystems
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.1145/2696081.2696095openalex-snapshot
Disjoint NP-Pairs and Propositional Proof Systems
inferred← citeshttps://doi.org/10.2307/2270853openalex-snapshot
Effectively retractable theories and degrees of undecidability
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.