An isomorphism between monoids of external embeddings: about definability in arithmetic
Prunescu, Mihai
J. Symbolic Logic, Tome 67 (2002) no. 1, p. 598-620 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We use a new version of the Definability Theoremof 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.
Publié le : 2002-06-14
Classification:  03C40,  11U09 
@article{1190150100,
     author = {Prunescu, Mihai},
     title = {An isomorphism between monoids of external embeddings: about definability in arithmetic},
     journal = {J. Symbolic Logic},
     volume = {67},
     number = {1},
     year = {2002},
     pages = { 598-620},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1190150100}
}

Prunescu, Mihai. An isomorphism between monoids of external embeddings: about definability in arithmetic. J. Symbolic Logic, Tome 67 (2002) no. 1, pp.  598-620. http://gdmltest.u-ga.fr/item/1190150100/