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

DOI10.1007/BF02358996zbMath0940.03052OpenAlexW2082956932MaRDI QIDQ1807463

Yu. V. 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

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

Related Items (2)

Unnamed Item ⋮ Hilbert's Tenth Problem in Coq

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The decision problem for exponential diophantine equations
• A direct method for simulating partial recursive functions by Diophantine equations
• Notes on Binomial Coefficients I-A Generalization of Lucas' Congruence†
• A proof of negative answer to Hilbert's $10$th problem
• DIOPHANTINE SETS
• Existential Definability in Arithmetic
• Arithmetical problems and recursively enumerable predicates

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