On the public citation graph
Diophantine representation of enumerable predicates
0 signed · 26 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.1016/s0049-237x(08)70846-2openalex-snapshot
Diophantine Representation of Recursively Enumerable Predicates
inferredcites →https://doi.org/10.1112/s0025579300002126openalex-snapshot
The real cubic case of Mahler's conjecture
inferredcites →https://doi.org/10.1112/s0025579300002163openalex-snapshot
On two‐centred expansions in cylindrical polar co‐ordinates
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-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferred← citeshttps://doi.org/10.1007/978-94-009-1910-5_22openalex-snapshot
Diophantine Representation of Fibonacci Numbers Over Natural Numbers
inferred← citeshttps://doi.org/10.1007/bf01084081openalex-snapshot
Arithmetical representations of enumerable sets with a small number of quantifiers
inferred← citeshttps://doi.org/10.1007/bf01084980openalex-snapshot
Theory of proofs (arithmetic and analysis)
inferred← citeshttps://doi.org/10.1007/bf01693980openalex-snapshot
A new proof of the theorem on exponential diophantine representation of enumerable sets
inferred← citeshttps://doi.org/10.1007/s10469-021-09617-zopenalex-snapshot
Two Problems for Solvable and Nilpotent Groups
inferred← citeshttps://doi.org/10.1007/s10958-014-1830-2openalex-snapshot
On a Diophantine Representation of the Predicate of Provability
inferred← citeshttps://doi.org/10.1016/0003-4843(82)90016-xopenalex-snapshot
Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
inferred← citeshttps://doi.org/10.1016/0022-314x(88)90098-4openalex-snapshot
On the application of Skolem's p-adic method to the solution of Thue equations
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80048-7openalex-snapshot
Chapter 15 Computable algebras and closure systems: Coding properties
inferred← citeshttps://doi.org/10.1080/00150517.1975.12430693openalex-snapshot
Diophantine Representation of the Fibonacci Numbers
inferred← citeshttps://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferred← citeshttps://doi.org/10.1090/s0273-0979-1987-15532-7openalex-snapshot
On the decidability of Diophantine problems in combinatorial geometry
inferred← citeshttps://doi.org/10.1134/s0001434620090047openalex-snapshot
On a Theorem of Matiyasevich
inferred← citeshttps://doi.org/10.2307/2272746openalex-snapshot
Some representations of Diophantine sets
inferred← citeshttps://doi.org/10.2307/2272832openalex-snapshot
Three universal representations of recursively enumerable sets
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.2969/msjmemoirs/02101c020openalex-snapshot
Part II. Lectures on height zeta functions: At the confluence of algebraic geometry, algebraic number theory, and analysis
inferred← citeshttps://doi.org/10.4213/im9342eopenalex-snapshot
Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank
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.