An isomorphism between monoids of external embeddings: About definability in arithmetic

Journal of Symbolic Logic 67 (2):598-620 (2002)
  Copy   BIBTEX

Abstract

We use a new version of the Definability Theorem of Beth in order to unify classical theorems of Yuri Matiyasevich and Jan Denef in one structural statement. We give similar forms for other important definability results from Arithmetic and Number Theory.

Other Versions

No versions found

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
53 (#405,542)

6 months
17 (#167,779)

Historical graph of downloads
How can I increase my downloads?