Existential Definability in Arithmetic
From MaRDI portal
Publication:5813178
DOI10.2307/1990711zbMath0047.24802OpenAlexW4238175543MaRDI QIDQ5813178
Publication date: 1952
Full work available at URL: https://doi.org/10.2307/1990711
Related Items (25)
A direct method for simulating partial recursive functions by Diophantine equations ⋮ Pell equations and exponentiation in fragments of arithmetic ⋮ Towards finite-fold Diophantine representations ⋮ The quest for Diophantine finite-fold-ness ⋮ Primes are nonnegative values of a polynomial in 10 variables ⋮ A new proof of the theorem on exponential diophantine representation of enumerable sets ⋮ Unsolvable Diophantine Problems ⋮ On equations in free monoids and semigroups with restrictions on solutions ⋮ Martin Davis and Hilbert’s Tenth Problem ⋮ A Story of Hilbert’s Tenth Problem ⋮ Pragmatic Platonism ⋮ My collaboration with Julia Robinson ⋮ A list of arithmetical structures complete with respect to the first-order definability ⋮ A proof of negative answer to Hilbert's $10$th problem ⋮ Unnamed Item ⋮ Diophantine induction ⋮ Unnamed Item ⋮ 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 ⋮ A new technique for obtaining diophantine representations via elimination of bounded universal quantifiers ⋮ Hilbert's Tenth Problem in Coq ⋮ Diophantine representations of the sequence of solutions of the Pell equation ⋮ There is no recursive link between the \(k\)-size of a model and its cardinality ⋮ Julia Robinson, in memoriam
Cites Work
This page was built for publication: Existential Definability in Arithmetic
