Problems equivalent to rational Diophantine solvability

DOI10.1016/0021-8693(89)90145-2zbMath0686.03018OpenAlexW2044732140MaRDI QIDQ1262302

Fred W. Roush, Kim Hang Kim

Publication date: 1989

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-8693(89)90145-2

zbMATH Keywords

solvabilityunsolvabilityrational Diophantine equations

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (6)

The work of Kim and Roush on questions of decidability in algebra and number theory ⋮ The publications of Ki Hang Kim ⋮ Extensions of Hilbert's tenth problem ⋮ Quadratic forms over \(C[t_ 1,t_ 2\)] ⋮ Diophantine undecidability of \({\mathbb{C}{}}(t_ 1,t_ 2)\) ⋮ Kapranov rank vs. tropical rank

Cites Work

• Unnamed Item
• Unnamed Item
• The decision problem for exponential diophantine equations
• Some general algorithms. I: Arithmetic groups
• A problem of equality for Galois cohomology
• Solving diophantine problems modulo every prime
• Decision problems concerning S-arithmetic groups
• Arithmetic on curves
• Hyperbolic and Diophantine analysis
• Undecidable diophantine equations
• GALOIS COHOMOLOGY AND SOME QUESTIONS OF THE THEORY OF ALGORITHMS
• A Reduction of Homogeneous Diophantine Problems

This page was built for publication: Problems equivalent to rational Diophantine solvability