Preprint
Article

Diophantine Equations with a Finite Number of Solutions: Craig Smorynski's Theorem, Harvey Friedman's Conjecture and Minhyong Kim's Guess

Altmetrics

Downloads

1307

Views

1235

Comments

0

This version is not peer-reviewed

Submitted:

01 March 2019

Posted:

01 March 2019

You are already at the latest version

Alerts
Abstract
Matiyasevich's theorem states that there is no algorithm to decide whether or not a given Diophantine equation has a solution in non-negative integers. Smorynski's theorem states that the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable. We prove: (1) Smorynski's theorem easily follows from Matiyasevich's theorem, (2 ) Hilbert's Tenth Problem for Q has a negative solution if and only if the set of all Diophantine equations with a finite number of rational solutions is not recursively enumerable.
Keywords: 
Subject: Computer Science and Mathematics  -   Logic
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated