On relative computability for curves

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We discuss a rational version of a conjecture of Matiyasevich, Davis, and Putnam on the relative decidability of the finiteness problem for Diophantine equations with respect to the existence problem. We formulate a suspicion that for rational solutions, the finiteness problem should be relatively decidable in contrast to the M-D-P conjecture for integer solutions.
Lecture at the mid-west model theory meeting, December, 2004

Keywords

Number Theory, Logic, 11D99

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/74152

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0502224
 http://arxiv.org/abs/math/0502224

Collections

arXiv