On the public citation graph
Arithmetical problems and recursively enumerable predicates
0 signed · 73 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.1007/bf01565439openalex-snapshot
General recursive functions of natural numbers
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)70253-8openalex-snapshot
On A Set of Integers not Definable by Means of One-Quantifier Predicates
inferredcites →https://doi.org/10.1016/s0049-237x(09)70461-6openalex-snapshot
On definable sets of positive integers )
inferredcites →https://doi.org/10.1017/s0022481200039815openalex-snapshot
Barkley Rosser. Extensions of some theorems of Gödel and Church. The journal of symbolic logic, vol. 1 (1936), pp. 87–91.
inferredcites →https://doi.org/10.1090/s0002-9939-1950-0038912-1openalex-snapshot
General Recursive Functions
inferredcites →https://doi.org/10.1090/s0002-9947-1943-0007371-8openalex-snapshot
Recursive Predicates and Quantifiers
inferredcites →https://doi.org/10.2307/2269028openalex-snapshot
Extensions of some theorems of Gödel and Church
inferredcites →https://doi.org/10.2307/2371045openalex-snapshot
An Unsolvable Problem of Elementary Number Theory
inferredcites →https://doi.org/10.4064/fm-34-1-81-112openalex-snapshot
On definable sets of positive integers
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.19740201904openalex-snapshot
Reduzierungen Unentscheidbarer Formaler Sprachen Über Induktiv Definierten Bereichen
inferred← citeshttps://doi.org/10.1002/malq.19750210120openalex-snapshot
Zur Benutzung der Verkettung als Basis für die Arithmetik
inferred← citeshttps://doi.org/10.1002/malq.19760220144openalex-snapshot
Zur Präfixoptimalität Gewisser ∄ … ∄‐Darstellungen Aufzählbarer Prädikate
inferred← citeshttps://doi.org/10.1002/malq.19770231602openalex-snapshot
Zum Begriff der Wortmischung ALS Basis Für Die Arithmetik
inferred← citeshttps://doi.org/10.1002/malq.19800260102openalex-snapshot
Zur Gödelisierungsfreien Darstellung der Rekursiven und Primitiv‐Rekursiven Funktionen und Rekursiv Aufzählbaren Prädikate Über Quotiententermmengen
inferred← citeshttps://doi.org/10.1002/malq.19810272504openalex-snapshot
Classification of Quantifier Prefixes Over Diophantine Equations
inferred← citeshttps://doi.org/10.1002/spe.4380170203openalex-snapshot
Tree matching and simplification
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-29462-7_10openalex-snapshot
Hilbert’s Tenth Problem: Diophantine Equations in the Twentieth Century
inferred← citeshttps://doi.org/10.1007/3-540-45455-1_4openalex-snapshot
Using Elliptic Curves of Rank One towards the Undecidability of Hilbert’s Tenth Problem over Rings of Algebraic Integers
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-319-41842-1_2openalex-snapshot
Martin Davis and Hilbert’s Tenth Problem
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.1007/978-3-642-54936-6_5openalex-snapshot
Undecidability in Number Theory
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/bf01091549openalex-snapshot
Existence of noneffectivizable estimates in the theory of exponential diophantine equations
inferred← citeshttps://doi.org/10.1007/bf01404106openalex-snapshot
Primes are nonnegative values of a polynomial in 10 variables
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/bf02358996openalex-snapshot
A new technique for obtaining diophantine representations via elimination of bounded universal quantifiers
inferred← citeshttps://doi.org/10.1007/s00012-008-2025-9openalex-snapshot
The equational compatibility problem for the real line
inferred← citeshttps://doi.org/10.1007/s10958-010-0179-4openalex-snapshot
Towards finite-fold Diophantine representations
inferred← citeshttps://doi.org/10.1007/s11424-024-4159-zopenalex-snapshot
Mixed Quantifier Prefixes over Diophantine Equations with Integer Variables
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/0304-3975(95)00237-5openalex-snapshot
Recursion theoretic characterizations of complexity classes of counting functions
inferred← citeshttps://doi.org/10.1016/j.apal.2008.09.009openalex-snapshot
Existential arithmetization of Diophantine equations
inferred← citeshttps://doi.org/10.1016/j.apal.2009.06.007openalex-snapshot
Extending and interpreting Post’s programme
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)70846-2openalex-snapshot
Diophantine Representation of Recursively Enumerable Predicates
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70268-xopenalex-snapshot
On Recursive Models of Formalised Arithmetic
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70352-0openalex-snapshot
On Recursive Unsolvability of Hilbert's Tenth Problem
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70462-8openalex-snapshot
The Classical and The ω-Complete Arithmetic
inferred← citeshttps://doi.org/10.1017/cbo9780511756306.015openalex-snapshot
Undecidable problems: a sampler
inferred← citeshttps://doi.org/10.1051/ro/2018036openalex-snapshot
Undecidability and hardness in mixed-integer nonlinear programming
inferred← citeshttps://doi.org/10.1070/im1971v005n01abeh001004openalex-snapshot
DIOPHANTINE REPRESENTATION OF ENUMERABLE PREDICATES
inferred← citeshttps://doi.org/10.1080/00029890.1973.11993265openalex-snapshot
Hilbert's Tenth Problem is Unsolvable
inferred← citeshttps://doi.org/10.1080/00029890.1998.12004995openalex-snapshot
Julia, A Life in Mathematics. By Constance Reid
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.1093/philmat/nkaf016openalex-snapshot
Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy
inferred← citeshttps://doi.org/10.1134/s0081543811080074openalex-snapshot
What can and cannot be done with Diophantine problems
inferred← citeshttps://doi.org/10.1142/9781848162778_0005openalex-snapshot
Definability in the Real Universe
inferred← citeshttps://doi.org/10.1215/ijm/1498032030openalex-snapshot
Four color theorem from three points of view
inferred← citeshttps://doi.org/10.2307/2268489openalex-snapshot
Formal systems of constructive mathematics
inferred← citeshttps://doi.org/10.2307/2268755openalex-snapshot
Arithmetical representation of recursively enumerable sets
inferred← citeshttps://doi.org/10.2307/2272746openalex-snapshot
Some representations of Diophantine 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.2307/2964397openalex-snapshot
Reductions of Hilbert's tenth problem
inferred← citeshttps://doi.org/10.2307/2964398openalex-snapshot
The classical and the ω-complete arithmetic
inferred← citeshttps://doi.org/10.2307/2964679openalex-snapshot
An unsolvable problem in number theory
inferred← citeshttps://doi.org/10.3792/pja/1195519486openalex-snapshot
A proof of negative answer to Hilbert's $10$th problem
inferred← citeshttps://doi.org/10.4099/jjm1924.28.0_1openalex-snapshot
Sur les Ensembles Nommables et le Fondement de l' Analyse Mathématique, I
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:35)2022openalex-snapshot
Hilbert's Tenth Problem in Coq (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.0802.1052openalex-snapshot
Two universal 3-quantifier representations of recursively 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.