We study a reduct ${\mathcal{L}_*}$ of the ring language where multiplication is restricted to a neighbourhood of zero. The language is chosen such that for p-adically closed fields K, the ${\mathcal{L}_*}$ -definable subsets of K coincide with the semi-algebraic subsets of K. Hence structures (K, ${\mathcal{L}_*}$ ) can be seen as the p-adic counterpart of the o-minimal structure of semibounded sets. We show that in this language, p-adically closed fields admit cell decomposition, using cells similar to p-adic semi-algebraic cells. From (...) this we can derive quantifier-elimination, and give a characterization of definable functions. In particular, we conclude that multiplication can only be defined on bounded sets, and we consider the existence of definable Skolem functions. (shrink)

Journal of Mathematical Logic, Volume 22, Issue 02, August 2022. We show that every definable nested family of closed and bounded subsets of a P-minimal field K has nonempty intersection. As an application we answer a question of Darnière and Halupczok showing that P-minimal fields satisfy the “extreme value property”: for every closed and bounded subset [math] and every interpretable continuous function [math] (where [math] denotes the value group), f(U) admits a maximal value. Two further corollaries are obtained as a (...) consequence of their work. The first one shows that every interpretable subset of [math] is already interpretable in the language of rings, answering a question of Cluckers and Halupczok. This implies in particular that every P-minimal field is polynomially bounded. The second one characterizes those P-minimal fields satisfying a classical cell preparation theorem as those having definable Skolem functions, generalizing a result of Mourgues. (shrink)

We develop a notion of cell decomposition suitable for studying weak p-adic structures definable). As an example, we consider a structure with restricted addition.

In this paper, we consider reducts of p-adically closed fields. We introduce a notion of shadows: sets Mf={∈K2∣|y|=|f|}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${M_f = \{ \in K^2 \mid |y| = |f|\}}$$\end{document}, where f is a semi-algebraic function. Adding symbols for such sets to a reduct of the ring language, we obtain expansions of the semi-affine language where multiplication is nowhere definable, thus giving a negative answer to a question posed by Marker, Peterzil and Pillay. The second (...) main result of this paper is the fact that in p-adic fields, full multiplication becomes definable if we add a rational function to the semi-affine language. (shrink)