Journal of Symbolic Logic

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

Mihai Prunescu

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

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.

Article information

Source
J. Symbolic Logic Volume 67, Issue 2 (2002), 598-620.

Dates
First available: 18 September 2007

Permanent link to this document
http://projecteuclid.org/euclid.jsl/1190150100

Mathematical Reviews number (MathSciNet)
MR1905157

Digital Object Identifier
doi:10.2178/jsl/1190150100

Zentralblatt MATH identifier
1027.03008

Subjects
Primary: 03C40: Interpolation, preservation, definability
Secondary: 11U09: Model theory [See also 03Cxx]

Citation

Prunescu, Mihai. An isomorphism between monoids of external embeddings: about definability in arithmetic. Journal of Symbolic Logic 67 (2002), no. 2, 598--620. doi:10.2178/jsl/1190150100. http://projecteuclid.org/euclid.jsl/1190150100.


Export citation