Universal diophantine equation

From MaRDI portal
Publication:3953760

DOI10.2307/2273588zbMath0492.03018OpenAlexW2000047385WikidataQ56289059 ScholiaQ56289059MaRDI QIDQ3953760

James P. Jones

Publication date: 1982

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273588




Related Items

Further results on Hilbert's tenth problemElimination of quantifiers from arithmetical formulas defining recursively enumerable setsShort Presburger Arithmetic Is HardPrime representing polynomialOn the computability of Nash equilibriaUndecidable problems in quantum field theoryMathematical programming: Turing completeness and applications to software analysisUnnamed ItemThe Riemann hypothesis as the parity of special binomial coefficientsEmbedding of provably unsolvable problems into stream ciphers;Встраивание доказуемо неразрешимых задач в шифры гаммированияConstraint Satisfaction Problems over Numeric DomainsLinear equations over multiplicative groups, recurrences, and mixing. IIUndecidability and incompleteness in classical mechanicsUncomputably large integral points on algebraic plane curves?Martin Davis and Hilbert’s Tenth ProblemKnapsack problem for nilpotent groupsPrimality testingOn a Diophantine representation of the predicate of provabilityThe scope of Gödel's first incompleteness theoremMy collaboration with Julia RobinsonDiophantine complexityWhat can and cannot be done with Diophantine problemsInfiniteness sets of primes, admitting diophantine representations in eight variablesDefinability, decidability, complexityThe incompleteness of theories of gamesSemi-algebraic sets of \(f\)-vectorsFrontier between decidability and undecidability: A surveyComparison of max-plus automata and joint spectral radius of tropical matricesUnnamed ItemUnnamed Item



Cites Work