English
Related papers

Related papers: On definable Skolem functions in weakly o-minimal …

200 papers

We introduce a new higher categorical structure called a weakly globular n-fold category. This structure is based on iterated internal categories and on the notion of weak globularity. We identify a suitable class of pseudo-functors whose…

Category Theory · Mathematics 2016-05-24 Simona Paoli

We study directed sets definable in o-minimal structures, showing that in expansions of ordered fields these admit cofinal definable curves, as well as a suitable analogue in expansions of ordered groups, and furthermore that no analogue…

Logic · Mathematics 2021-09-17 Pablo Andujar Guerrero , Margaret E. M. Thomas , Erik Walsberg

The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…

Logic · Mathematics 2020-05-13 Emil Jeřábek

We investigate the property of elimination of imaginaries for some special cases of ordered abelian groups. We show that certain Hahn products of ordered abelian groups do not eliminate imaginaries in the pure language of ordered groups.…

Logic · Mathematics 2021-12-13 Martina Liccardo

We prove the claim in the title by showing that a definable Grauert Direct Image Theorem in o-minimal geometry would imply a weak representability-like property of the definable Picard functor. However, this weak representability cannot…

Algebraic Geometry · Mathematics 2026-02-16 Hélène Esnault , Moritz Kerz

We investigate the cardinality $\mathfrak n_{\dim}(\mathcal M)$ of the sets of dimension functions on weakly o-minimal structures $\mathcal M$ admitting strong cell decomposition.

Logic · Mathematics 2025-12-12 Masato Fujita

We initiate an investigation of structures on the set of real numbers having the property that path components of definable sets are definable. All o\nobreakdash-\hspace{0pt}minimal structures on $(\mathbb{R},<)$ have the property, as do…

Termination analysis of linear loops plays a key r\^{o}le in several areas of computer science, including program verification and abstract interpretation. Already for the simplest variants of linear loops the question of termination…

Computational Complexity · Computer Science 2020-05-13 Shaull Almagor , Dmitry Chistikov , Joël Ouaknine , James Worrell

We give examples of $\mathrm{NIP}$ structures in which new algebraic structure appears in the Shelah completion. In particular we construct a weakly o-minimal structure $\mathscr{M}$ such that $\mathscr{M}$ does not interpret an infinite…

Logic · Mathematics 2026-05-13 Erik Walsberg

We prove that the class of all ordinals Ord is not weakly compact with respect to definable classes. Specifically, in any model of ZFC, the definable tree property fails for Ord, in that there is a definable Ord tree with no definable…

Logic · Mathematics 2017-10-27 Ali Enayat , Joel David Hamkins

We give necessary and sufficient conditions on a non-oscillatory curve in an o-minimal field such that, for any bounded definable function, the germ of the function on an initial segment of the curve can be continuously extended to a closed…

Logic · Mathematics 2011-04-22 Janak Ramakrishnan

We prove that groups definable in o-minimal structures have Cartan subgroups, and only finitely many conjugacy classes of such subgroups. We also delineate with precision how these subgroups cover the ambient group, in general very largely…

Group Theory · Mathematics 2012-11-21 Elias Baro , Eric Jaligot , Margarita Otero

We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…

Computational Complexity · Computer Science 2018-10-01 Noson S. Yanofsky

We show that an infinite group is definable in any non trivial geometric $C$-minimal structure which is definably maximal and does not have any definable bijection between a bounded interval and an unbounded one in its canonical tree. No…

Logic · Mathematics 2014-10-16 Françoise Delon , Fares Maalouf

In this paper we study elimination of imaginaries in some classes of henselian valued fields of equicharacteristic zero and residue field algebraically closed. The results are sensitive to the complexity of the value group. We focus first…

Logic · Mathematics 2022-05-10 Mariana Vicaria

Answering a question of Junker and Ziegler, we construct a countable first order structure which is not omega-categorical, but does not have any proper non-trivial reducts, in either of two senses (model-theoretic, and group-theoretic). We…

Logic · Mathematics 2015-02-27 Manuel Bodirsky , Dugald Macpherson

Skolem functions play a central role in the study of first order logic, both from theoretical and practical perspectives. While every Skolemized formula in first-order logic makes use of Skolem constants and/or functions, not all such…

Logic in Computer Science · Computer Science 2022-08-05 S. Akshay , Supratik Chakraborty

We prove that some holomorphic continuations of functions in the classes $\mathbf{an}^*$ and $\mathcal{G}$ are definable in the o-minimal structures $\mathbb{R}_{\mathrm{an}^*}$ and $\mathbb{R}_{\mathcal{G}}$ respectively. More…

Logic · Mathematics 2025-06-19 Adele Padgett , Patrick Speissegger

Decomposable ordered structures were introduced in \cite{OnSt} to develop a general framework to study `finite-dimensional' totally ordered structures. This paper continues this work to include decomposable structures on which a ordered…

Logic · Mathematics 2014-02-27 Eliana Barriga , Alf Onshuus , Charles Steinhorn

Let $M$ be a $C$-minimal structure and $T$ its canonical tree (which corresponds in an ultrametric space to the set of closed balls with radius different than $\infty$ ordered by inclusion). We present a description of definable locally…

Logic · Mathematics 2014-10-14 Pablo Cubides Kovacsics