On the public citation graph
A new proof of the theorem on exponential diophantine representation of enumerable sets
0 signed · 37 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/cpa.3160240205openalex-snapshot
An explicit diophantine definition of the exponential function
inferredcites →https://doi.org/10.1007/bf01094400openalex-snapshot
Diophantine representation of enumerable predicates
inferredcites →https://doi.org/10.1007/bf01149791openalex-snapshot
On equations in free semigroups and groups
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.1016/s0049-237x(09)70565-8openalex-snapshot
The Undecidability of Exponential Diophantine Equations
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.1090/s0002-9947-1952-0048374-2openalex-snapshot
Existential Definability in Arithmetic
inferredcites →https://doi.org/10.1112/jlms/s2-8.3.545openalex-snapshot
Notes on Binomial Coefficients I-A Generalization of Lucas' Congruence†
inferredcites →https://doi.org/10.1112/jlms/s2-8.3.555openalex-snapshot
Notes on Binomial Coefficients Iii-Any Integer Divides Almost All Binomial Coefficients†
inferredcites →https://doi.org/10.1515/crll.1852.44.93openalex-snapshot
Über die Ergänzungssätze zu den allgemeinen Reciprocitätsgesetzen.
inferredcites →https://doi.org/10.2307/1970289openalex-snapshot
The Decision Problem for Exponential Diophantine Equations
inferredcites →https://doi.org/10.2307/2266325openalex-snapshot
Arithmetical problems and recursively enumerable predicates
inferredcites →https://doi.org/10.3792/pja/1195519486openalex-snapshot
A proof of negative answer to Hilbert's $10$th problem
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.2139/ssrn.4871885openalex-extracted
Elementary Formulas for Greatest Common Divisors and Semiprime Factors
inferred← citeshttps://doi.org/10.1007/11494645_39openalex-snapshot
Hilbert’s Tenth Problem and Paradigms of Computation
inferred← citeshttps://doi.org/10.1007/3-540-13331-3_44openalex-snapshot
Universal Turing machines (UTM) and Jones-Matiyasevich-masking
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_4openalex-snapshot
Computation Paradigms in Light of Hilbert's Tenth Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_9openalex-snapshot
On the Existential Arithmetics with Addition and Bitwise Minimum
inferred← citeshttps://doi.org/10.1007/978-3-032-01475-7_1openalex-snapshot
Formal Languages and Arithmetic Theories: Recent Results and Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-41842-1_4openalex-snapshot
A Story of Hilbert’s Tenth Problem
inferred← citeshttps://doi.org/10.1016/0001-8708(91)90006-sopenalex-snapshot
The complexity of antidifferentiation
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90048-xopenalex-snapshot
A normal form for arithmetical representation of N P-sets
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90014-0openalex-snapshot
A direct method for simulating partial recursive functions by Diophantine equations
inferred← citeshttps://doi.org/10.1016/j.matcom.2004.05.013openalex-snapshot
Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71882-2openalex-snapshot
Exponential Diophantine Representation of Recursively Enumerable Sets
inferred← citeshttps://doi.org/10.1134/s1990478907030106openalex-snapshot
Superpositions of elementary arithmetic functions
inferred← citeshttps://doi.org/10.2307/2274135openalex-snapshot
Register machine proof of the theorem on exponential diophantine representation of enumerable sets
inferred← citeshttps://doi.org/10.48550/arxiv.1303.5777openalex-snapshot
Exponential prefixed polynomial equations
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.