No CrossRef data available.
Article contents
An isomorphism between monoids of external embeddings: About definability in arithmetic
Published online by Cambridge University Press: 12 March 2014
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2002