Arithmetical problems and recursively enumerable predicates
From MaRDI portal
Publication:5820550
DOI10.2307/2266325zbMath0051.24509OpenAlexW1964691638MaRDI QIDQ5820550
Publication date: 1953
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2266325
Related Items (27)
A direct method for simulating partial recursive functions by Diophantine equations ⋮ Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets ⋮ Register machine proof of the theorem on exponential diophantine representation of enumerable sets ⋮ Recursion theoretic characterizations of complexity classes of counting functions ⋮ Towards finite-fold Diophantine representations ⋮ On the existential arithmetics with addition and bitwise minimum ⋮ Arithmetical representation of recursively enumerable sets ⋮ Formal systems of constructive mathematics ⋮ Primes are nonnegative values of a polynomial in 10 variables ⋮ A new proof of the theorem on exponential diophantine representation of enumerable sets ⋮ The classical and the ω-complete arithmetic ⋮ Extending and interpreting Post's programme ⋮ Reductions of Hilbert's tenth problem ⋮ Some representations of Diophantine sets ⋮ Martin Davis and Hilbert’s Tenth Problem ⋮ A Story of Hilbert’s Tenth Problem ⋮ A proof of negative answer to Hilbert's $10$th problem ⋮ Diophantine complexity ⋮ Unnamed Item ⋮ Arithmetical representations of enumerable sets with a small number of quantifiers ⋮ Some nonstationary linear and quasilinear systems occuring in the investigation of the motion of viscous fluids ⋮ Existential arithmetization of Diophantine equations ⋮ Existence of noneffectivizable estimates in the theory of exponential Diophantine equations ⋮ What can and cannot be done with Diophantine problems ⋮ A new technique for obtaining diophantine representations via elimination of bounded universal quantifiers ⋮ Hilbert's Tenth Problem in Coq ⋮ A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets
Cites Work
This page was built for publication: Arithmetical problems and recursively enumerable predicates
