Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-18T02:44:22.805Z Has data issue: false hasContentIssue false

A version of p-adic minimality

Published online by Cambridge University Press:  12 March 2014

Raf Cluckers
Affiliation:
Université Lille 1, Laboratoiré Painlevé, CNRS - UMR 8524, Cité Scientifique, 59655 Villeneuve d'Ascq Cedex, FranceKatholieke Universiteit Leuven, Department of Mathematics, Celestijnenlaan 200B, B-3001 Leuven, Belgium, E-mail: Raf.Cluckers@math.univ-lille1.fr, URL: http://math.univ-lille1.fr/~cluckers
Eva Leenknegt
Affiliation:
Purdue University, Department of Mathematics, 150 N. University Street, West Lafayette, IN 47907-2067, USA, E-mail: eleenkne@math.purdue.edu, URL: http://www.math.purdue.edu/~eleenkne

Abstract

We introduce a very weak language on p-adic fields K, which is just rich enough to have exactly the same definable subsets of the line K that one has using the ring language. (In our context, definable always means definable with parameters.) We prove that the only definable functions in the language are trivial functions. We also give a definitional expansion of in which K has quantifier elimination, and we obtain a cell decomposition result for -definable sets.

Our language can serve as a p-adic analogue of the very weak language (<) on the real numbers, to define a notion of minimality on the field of p-adic numbers and on related valued fields. These fields are not necessarily Henselian and may have positive characteristic.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2012

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