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

DOI10.1007/BF02358996zbMATH Open0940.03052OpenAlexW2082956932MaRDI QIDQ1807463FDOQ1807463

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

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

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)

Cites Work

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

Cited In (7)

• Towards finite-fold Diophantine representations
• Title not available (Why is that?)
• Existential arithmetization of Diophantine equations
• Hilbert's Tenth Problem in Coq
• Register machine proof of the theorem on exponential diophantine representation of enumerable sets
• Reduction of unknowns in diophantine representations
• A transfer method from bounded existential Diophantine equations to Tarski algebra formulas

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)