On the public citation graph

Representability op recursively enumerable sets in formal theories

https://doi.org/10.1007/bf01977641
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.1002/malq.19550010205openalex-snapshot
Creative sets
inferredcites →https://doi.org/10.2307/2266324openalex-snapshot
On axiomatizability within a system
inferredcites →https://doi.org/10.2307/2964013openalex-snapshot
Degrees of formal systems
inferredcites →https://doi.org/10.2307/2964178openalex-snapshot
Degrees of unsolvability associated with classes of 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.1002/malq.19610070710openalex-snapshot
Relative Interpretations
inferred← citeshttps://doi.org/10.1007/978-3-662-21635-4openalex-snapshot
Aspects of Incompleteness
inferred← citeshttps://doi.org/10.1007/978-3-662-21635-4_4openalex-snapshot
Numerations of R.E. Sets
inferred← citeshttps://doi.org/10.1007/bf00970389openalex-snapshot
Computability of partial functions and enumerability of sets in Peano's arithmetic
inferred← citeshttps://doi.org/10.1007/bf01974157openalex-snapshot
Representability of recursively enumerable sets in formal theories
inferred← citeshttps://doi.org/10.1007/bf02023013openalex-snapshot
Variants of Robinson's essentially undecidable theoryR
inferred← citeshttps://doi.org/10.1007/bf02025806openalex-snapshot
1 — Consistency and faithful interpretations
inferred← citeshttps://doi.org/10.1007/s00153-017-0557-4openalex-snapshot
Interpretability suprema in Peano Arithmetic
inferred← citeshttps://doi.org/10.1007/s11225-023-10045-6openalex-snapshot
Some Observations on the FGH Theorem
inferred← citeshttps://doi.org/10.1016/0020-0255(69)90016-4openalex-snapshot
Strong representability of partial functions in arithmetic theories
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70025-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70278-2openalex-snapshot
Representability of Sets in Formal Systems
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.1017/s1755020321000307openalex-snapshot
HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC
inferred← citeshttps://doi.org/10.1070/rm2010v065n05abeh004703openalex-snapshot
Gödel incompleteness theorems and the limits of their applicability. I
inferred← citeshttps://doi.org/10.1090/s0002-9939-1960-0120150-1openalex-snapshot
Exact Separation of Recursively Enumerable Sets Within Theories
inferred← citeshttps://doi.org/10.1090/s0002-9939-1967-0230617-xopenalex-snapshot
Representability of Partial Recursive Functions in Formal Theories
inferred← citeshttps://doi.org/10.1090/s0002-9939-1978-0476452-6openalex-snapshot
Avoiding self-referential statements
inferred← citeshttps://doi.org/10.1090/s0002-9947-1965-0195724-1openalex-snapshot
On Creative Sets and Indices of Partial Recursive Functions
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/suga/487openalex-snapshot
Mathematical developments of the incompleteness theorems
inferred← citeshttps://doi.org/10.1093/jigpal/jzac054openalex-snapshot
The early history of formal diagonalization
inferred← citeshttps://doi.org/10.1093/logcom/exad023openalex-snapshot
Effective inseparability and some applications in meta-mathematics
inferred← citeshttps://doi.org/10.1093/logcom/exad075openalex-snapshot
Numeral completeness of weak theories of arithmetic
inferred← citeshttps://doi.org/10.4213/rm9378openalex-snapshot
Теоремы Гeделя о неполноте и границы их применимости. I
inferred← citeshttps://doi.org/10.48550/arxiv.1602.01822openalex-snapshot
Slow and Ordinary Provability for Peano Arithmetic
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.