Diophantine equivalence and countable rings

Journal of Symbolic Logic 59 (3):1068-1095 (1994)
  Copy   BIBTEX


We show that Diophantine equivalence of two suitably presented countable rings implies that the existential polynomial languages of the two rings have the same "expressive power" and that their Diophantine sets are in some sense the same. We also show that a Diophantine class of countable rings is contained completely within a relative enumeration class and demonstrate that one consequence of this fact is the existence of infinitely many Diophantine classes containing holomophy rings of Q



    Upload a copy of this work     Papers currently archived: 92,100

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library


Added to PP

22 (#711,228)

6 months
3 (#981,027)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Rational separability over a global field.Alexandra Shlapentokh - 1996 - Annals of Pure and Applied Logic 79 (1):93-108.
Weak presentations of non-finitely generated fields.Alexandra Shlapentokh - 1998 - Annals of Pure and Applied Logic 94 (1-3):223-252.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references