Extensions of Hilbert's tenth problem

DOI10.2307/2275396zbMath0812.11071OpenAlexW2006742402MaRDI QIDQ4302340

Thanases Pheidas

Publication date: 15 August 1994

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

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

zbMATH Keywords

surveyelliptic curvesbibliographyopen questionsHilbert's tenth problemhigher degree diophantine equations

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) Diophantine equations (11D99)

Related Items (6)

Undecidable existential theories of polynomial rings and function fields ⋮ Hilbert's Tenth problem for function fields of varieties over number fields and \(p\)-adic fields ⋮ Endomorphisms of elliptic curves and undecidability in function fields of positive characteristic. ⋮ Decidability of Sub-theories of Polynomials over a Finite Field ⋮ Decidability questions for a ring of Laurent polynomials ⋮ On the theories of free solvable groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(p\)-adic and real subanalytic sets
• Ultraproducts and approximation in local rings. I
• Hilbert's tenth problem for fields of rational functions over finite fields
• Model theory of modules
• Some general algorithms. I: Arithmetic groups
• Decidable theories of preordered fields
• Quadratic forms over \(C[t_ 1,t_ 2\)]
• Diophantine undecidability of \({\mathbb{C}{}}(t_ 1,t_ 2)\)
• Solving diophantine problems over all residue class fields of a number field and all finite fields
• Problems equivalent to rational Diophantine solvability
• All arithmetical sets of powers of primes are first-order definable in terms of the successor function and the coprimeness predicate
• The elementary theory of finite fields
• Diophantine problems over local fields. III: Decidable fields
• Solving diophantine problems modulo every prime
• Strictly local solutions of diophantine equations
• A new decision method for elementary algebra
• Integer solutions of systems of quadratic equations
• LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
• Register machine proof of the theorem on exponential diophantine representation of enumerable sets
• A generalization of the Tarski-Seidenberg theorem, and some nondefinability results
• Answer to a problem raised by J. Robinson: The arithmetic of positive or negative integers is definable from successor and divisibility
• Alfred Tarski's elimination theory for real closed fields
• A computable ordinary differential equation which possesses no computable solution
• Undecidable diophantine equations
• How to solve a quadratic equation in integers
• Classification of Quantifier Prefixes Over Diophantine Equations
• Diophantine Representation of the Set of Prime Numbers
• Hilbert's Tenth Problem is Unsolvable
• Decision procedures for real and p‐adic fields
• Some undecidable problems involving elementary functions of a real variable
• THE UNDECIDABILITY OF PURE TRANSCENDENTAL EXTENSIONS OF REAL FIELDS
• Definability and decision problems in arithmetic

This page was built for publication: Extensions of Hilbert's tenth problem