An unsolvable problem in number theory
From MaRDI portal
Publication:3843614
DOI10.2307/2964679zbMath0108.00701OpenAlexW2102743423MaRDI QIDQ3843614
Publication date: 1960
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2964679
Related Items
A direct method for simulating partial recursive functions by Diophantine equations ⋮ Further results on Hilbert's tenth problem ⋮ The number of certain integral polynomials and nonrecursive sets of integers, Part 2 ⋮ Unnamed Item ⋮ Primes are nonnegative values of a polynomial in 10 variables ⋮ Unsolvable Diophantine Problems ⋮ Martin Davis and Hilbert’s Tenth Problem ⋮ Three universal representations of recursively enumerable sets ⋮ Diophantine complexity ⋮ Some decision problems for polynomial mappings ⋮ Some nonstationary linear and quasilinear systems occuring in the investigation of the motion of viscous fluids ⋮ Polynomial indexing of integer lattice-points. II. Nonexistence results for higher-degree polynomials ⋮ Existence of noneffectivizable estimates in the theory of exponential Diophantine equations ⋮ What can and cannot be done with Diophantine problems ⋮ Bibliography of Hilary Putnam’s Writings in Logic and Mathematics ⋮ Infiniteness sets of primes, admitting diophantine representations in eight variables
