Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T08:39:45.087Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  12 March 2014

Mihai Prunescu*
Affiliation:
Institut Für Mathematik und Informatik, Universität Greifswald, GermanyInstitute of Mathematics of the Romanian Academy, Bucharest, Romania, E-mail: prunescu@mail.uni-greifswald.de

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable