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

DOI10.3792/PJA/1195519486MaRDI QIDQ4404870zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• Arithmetical problems and recursively enumerable predicates
• Contributions to the theory of diophantine equations I. On the representation of integers by binary forms
• Existential Definability in Arithmetic
• scientific article; zbMATH DE number 3336816 (Why is no real title available?)
• The decision problem for exponential diophantine equations

Cited in

(4)

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

This page was built for publication: A proof of negative answer to Hilbert's $10$th problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4404870)