On the public citation graph

Three universal representations of recursively enumerable sets

0 signed · 52 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/cpa.3160240205openalex-snapshot
An explicit diophantine definition of the exponential function
inferredcites →https://doi.org/10.1007/978-3-642-61867-3_14openalex-snapshot
Zur Theorie der quadratischen Formen
inferredcites →https://doi.org/10.1007/bf01084081openalex-snapshot
Arithmetical representations of enumerable sets with a small number of quantifiers
inferredcites →https://doi.org/10.1007/bf01094400openalex-snapshot
Diophantine representation of enumerable predicates
inferredcites →https://doi.org/10.1007/bf01695515openalex-snapshot
Diophantische Gleichungen
inferredcites →https://doi.org/10.1007/bf01700692openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1007/s00605-006-0423-7openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1016/s0049-237x(09)70352-0openalex-snapshot
On Recursive Unsolvability of Hilbert's Tenth Problem
inferredcites →https://doi.org/10.1070/im1971v005n01abeh001004openalex-snapshot
DIOPHANTINE REPRESENTATION OF ENUMERABLE PREDICATES
inferredcites →https://doi.org/10.1080/00029890.1973.11993265openalex-snapshot
Hilbert's Tenth Problem is Unsolvable
inferredcites →https://doi.org/10.1080/00029890.1976.11994142openalex-snapshot
Diophantine Representation of the Set of Prime Numbers
inferredcites →https://doi.org/10.1080/00150517.1975.12430693openalex-snapshot
Diophantine Representation of the Fibonacci Numbers
inferredcites →https://doi.org/10.1080/00150517.1976.12430566openalex-snapshot
Diophantine Representation of the Lucas Numbers
inferredcites →https://doi.org/10.1090/pspum/020/0316234openalex-snapshot
Hilbert’s tenth problem
inferredcites →https://doi.org/10.1090/s0002-9947-1952-0048374-2openalex-snapshot
Existential Definability in Arithmetic
inferredcites →https://doi.org/10.1142/9789812564894_0013openalex-snapshot
ENUMERABLE SETS ARE DIOPHANTINE
inferredcites →https://doi.org/10.2307/1970289openalex-snapshot
The Decision Problem for Exponential Diophantine Equations
inferredcites →https://doi.org/10.2307/2268755openalex-snapshot
Arithmetical representation of recursively enumerable sets
inferredcites →https://doi.org/10.2307/2272746openalex-snapshot
Some representations of Diophantine sets
inferredcites →https://doi.org/10.2307/2964679openalex-snapshot
An unsolvable problem in number theory
inferredcites →https://doi.org/10.4064/aa-27-1-521-553openalex-snapshot
Reduction of an arbitrary diophantine equation to one in 13 unknowns

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf01769063openalex-snapshot
Some undecidable determined games
inferred← citeshttps://doi.org/10.1007/bf02318026openalex-snapshot
Some diophantine forms of gödel's theorem
inferred← citeshttps://doi.org/10.1007/s00153-024-00958-xopenalex-snapshot
Constructivity conditions on immune sets
inferred← citeshttps://doi.org/10.1007/s11787-014-0107-3openalex-snapshot
The Scope of Gödel’s First Incompleteness Theorem
inferred← citeshttps://doi.org/10.1016/0020-0190(79)90155-8openalex-snapshot
On finding test data sets for loop free programs
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70326-4openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0165-1889(97)00012-2openalex-snapshot
Expository notes on computability and complexity in (arithmetical) games
inferred← citeshttps://doi.org/10.1017/9781108981972openalex-snapshot
Gödel's Incompleteness Theorems
inferred← citeshttps://doi.org/10.1017/s0022481200049112openalex-snapshot
JSL volume 4 issue 3 Cover and Back matter
inferred← citeshttps://doi.org/10.1090/noti2249openalex-snapshot
Hilbert’s Tenth Problem
inferred← citeshttps://doi.org/10.1090/s0273-0979-1980-14832-6openalex-snapshot
Undecidable diophantine equations
inferred← citeshttps://doi.org/10.1093/0198295278.001.0001openalex-snapshot
Computable Economics
inferred← citeshttps://doi.org/10.1093/0198295278.001.0001.002.004openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/0198295278.001.0001.002.005openalex-snapshot
Dedication
inferred← citeshttps://doi.org/10.1093/0198295278.001.0001.002.006openalex-snapshot
The Arne Ryde Foundation
inferred← citeshttps://doi.org/10.1093/0198295278.002.0001openalex-snapshot
Preface and Acknowledgments
inferred← citeshttps://doi.org/10.1093/0198295278.003.0001openalex-snapshot
Introduction and Overview
inferred← citeshttps://doi.org/10.1093/0198295278.003.0002openalex-snapshot
Ideas, Pioneers, and Precursors
inferred← citeshttps://doi.org/10.1093/0198295278.003.0003openalex-snapshot
Computable Rationality
inferred← citeshttps://doi.org/10.1093/0198295278.003.0004openalex-snapshot
Adaptive Behavior
inferred← citeshttps://doi.org/10.1093/0198295278.003.0005openalex-snapshot
The Modern Theory of Induction
inferred← citeshttps://doi.org/10.1093/0198295278.003.0006openalex-snapshot
Learning in a Computable Setting
inferred← citeshttps://doi.org/10.1093/0198295278.003.0007openalex-snapshot
Effective Playability in Arithmetical Games
inferred← citeshttps://doi.org/10.1093/0198295278.003.0008openalex-snapshot
Notes on Computational Complexity
inferred← citeshttps://doi.org/10.1093/0198295278.003.0009openalex-snapshot
Explorations in Computable Economics
inferred← citeshttps://doi.org/10.1093/0198295278.003.0010openalex-snapshot
Conclusions: Reflections and Hopes
inferred← citeshttps://doi.org/10.1093/0198295278.005.0001openalex-snapshot
A Child's Guide to Elementary Aspects of Computability
inferred← citeshttps://doi.org/10.1515/crll.2004.023openalex-snapshot
On the integer solutions of quadratic equations
inferred← citeshttps://doi.org/10.2307/2273588openalex-snapshot
Universal diophantine equation
inferred← citeshttps://doi.org/10.2307/2273619openalex-snapshot
Complexity bounds on proofs
inferred← citeshttps://doi.org/10.2307/2274135openalex-snapshot
Register machine proof of the theorem on exponential diophantine representation of enumerable sets
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.