Towards finite-fold Diophantine representations

DOI10.1007/S10958-010-0179-4zbMATH Open1282.11166OpenAlexW2034998677MaRDI QIDQ393229FDOQ393229

Authors: Yu. Matiyasevich 

Publication date: 16 January 2014

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

Full work available at URL: https://doi.org/10.1007/s10958-010-0179-4

Recommendations

• Register machine proof of the theorem on exponential diophantine representation of enumerable sets
• A new technique for obtaining diophantine representations via elimination of bounded universal quantifiers
• scientific article; zbMATH DE number 4112574
• Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation
• A Note on Diophantine Representations

Mathematics Subject Classification ID

Basic properties of first-order languages and structures (03C07) Diophantine equations (11D99) Decidability (number-theoretic aspects) (11U05)

Cites Work

• Algorithmic Information Theory
• The decision problem for exponential diophantine equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computability and randomness of Nash equilibrium in infinite games
• Existence of noneffectivizable estimates in the theory of exponential Diophantine equations
• Two types of explicit continued fractions
• Title not available (Why is that?)
• Some new families of Tasoevian and Hurwitzian continued fractions
• Title not available (Why is that?)
• A note on the number of zeros of polynomials and exponential polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• 48 More Solutions of Martin Davis's Quaternary Quartic Equation
• On the Number of Solutions of Diophantine Equations
• THE EQUATIONS 3x²−2 = y² AND 8x²−7 = z²
• Title not available (Why is that?)
• Existential Definability in Arithmetic
• Arithmetical problems and recursively enumerable predicates
• Decidability of some Problems Pertaining to Base 2 Exponential Diophantine Equations

Cited In (6)

• Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation
• A few factors from the Euler product are sufficient for calculating the zeta function with high precision
• On existential definitions of c.e. subsets of rings of functions of characteristic 0
• Register machine proof of the theorem on exponential diophantine representation of enumerable sets
• The quest for Diophantine finite-fold-ness
• Title not available (Why is that?)

This page was built for publication: Towards finite-fold Diophantine representations

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