A proof of negative answer to Hilbert's $10$th problem

DOI10.3792/pja/1195519486zbMath0279.02028OpenAlexW2110477410MaRDI QIDQ4404870

Ken Hirose, Shigeaki Iida

Publication date: 1973

Published in: Proceedings of the Japan Academy, Series A, Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3792/pja/1195519486

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Higher degree equations; Fermat's equation (11D41) Applications of computability and recursion theory (03D80)

Related Items

A direct method for simulating partial recursive functions by Diophantine equations, Register machine proof of the theorem on exponential diophantine representation of enumerable sets, A new proof of the theorem on exponential diophantine representation of enumerable sets, A new technique for obtaining diophantine representations via elimination of bounded universal quantifiers

Cites Work

• Unnamed Item
• The decision problem for exponential diophantine equations
• Contributions to the theory of diophantine equations I. On the representation of integers by binary forms
• Existential Definability in Arithmetic
• Arithmetical problems and recursively enumerable predicates