A new technique for obtaining diophantine representations via elimination of bounded universal quantifiers

DOI10.1007/BF02358996MaRDI QIDQ1807463zbMATH OpenOpenAlexFDO

Authors Yu. Matiyasevich

Publication date 22 November 1999

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/68551

zbMATH Keywords

recursively enumerable setarithmetic representationbounded universal quantifierDavis normal formexponential diophantine representation

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Decidability and field theory (12L05) Quantifier elimination, model completeness, and related topics (03C10) Decidability (number-theoretic aspects) (11U05)

Recommendations

• THE EXPONENTIAL DIOPHANTINE PROBLEM FOR
• Register machine proof of the theorem on exponential diophantine representation of enumerable sets
• Towards finite-fold Diophantine representations
• A direct method for simulating partial recursive functions by Diophantine equations
• Reduction of unknowns in diophantine representations

Cites work

• scientific article; zbMATH DE number 42574 (Why is no real title available?)
• scientific article; zbMATH DE number 3512041 (Why is no real title available?)
• scientific article; zbMATH DE number 3336816 (Why is no real title available?)
• A direct method for simulating partial recursive functions by Diophantine equations
• A proof of negative answer to Hilbert's $10$th problem
• Arithmetical problems and recursively enumerable predicates
• DIOPHANTINE SETS
• Existential Definability in Arithmetic
• Notes on Binomial Coefficients I-A Generalization of Lucas' Congruence†
• The decision problem for exponential diophantine equations

Cited in

(7)

• Reduction of unknowns in diophantine representations
• Register machine proof of the theorem on exponential diophantine representation of enumerable sets
• Towards finite-fold Diophantine representations
• Hilbert's Tenth Problem in Coq
• Existential arithmetization of Diophantine equations
• A transfer method from bounded existential Diophantine equations to Tarski algebra formulas
• scientific article; zbMATH DE number 7566048 (Why is no real title available?)

This page was built for publication: A new technique for obtaining diophantine representations via elimination of bounded universal quantifiers

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