Related papers: Exponential-constructible functions in $P$-minimal…

The notion of constructible functions in the setting of tame real geometry has been introduced by Cluckers and Dan Miller in their work on parametric integration of globally subanalytic functions. A function on a globally subanalytic set is…

We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…

We enrich the class of power-constructible functions, introduced in [CCRS23], to a class of algebras of functions which contains all complex powers of subanalytic functions, their parametric Mellin and Fourier transforms, and which is…

Let K be an algebraically closed field, X a K-scheme, and X(K) the set of closed points in X. A constructible set C in X(K) is a finite union of subsets Y(K) for finite type subschemes Y in X. A constructible function f : X(K) --> Q has…

It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…

We show that the class of $\mathcal{L}$-constructible functions is closed under integration for any $P$-minimal expansion of a $p$-adic field $(K,\mathcal{L})$. This generalizes results previously known for semi-algebraic and sub-analytic…

Let $T$ be an o-minimal theory expanding $\mathrm{RCF}$ and $T_\mathrm{convex}$ be the common theory of its models expanded by predicate for a non-trivial $T$-convex valuation ring. We call an elementary extension $(\mathbb{E}, \mathcal{O})…

We study Lebesgue integration of sums of products of globally subanalytic functions and their logarithms, called constructible functions. Our first theorem states that the class of constructible functions is stable under integration. The…

Given an o-minimal structure ${\mathcal M}$ with a group operation, we show that for a properly convex subset $U$, the theory of the expanded structure ${\mathcal M}'=({\mathcal M},U)$ has definable Skolem functions precisely when…

We study projective functions. We prove that projective functions generalise lower and upper-semianalytic ones while being stable by composition and difference. We show that the class of projective functions is closed under sums,…

We develop the notion of coherent ultrafilters (extenders without normality or well-foundedness). We then use definable coherent ultraproducts to characterize any extension of a model $M$ in any fragment of $\mathbb{L}_{\infty, \omega}$…

We show there are intermediate $P$-minimal structures between the semi-algebraic and sub-analytic languages which do not have definable Skolem functions. As a consequence, by a result of Mourgues, this shows there are $P$-minimal structures…

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…

We introduce spaces of exponential constructible functions in the motivic setting for which we construct direct image functors in the absolute and relative cases. This allows us to define a motivic Fourier transformation for which we get…

We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of functions that can be modeled in type-theory based theorem proving tool to…

Following recent work of R. Cluckers and F. Loeser [Fonctions constructible et integration motivic I, C. R. Math. Acad. Sci. Paris 339 (2004) 411 - 416] on motivic integration, we develop a direct image formalism for positive constructible…

Finite dimensional subspaces spanned by exponential functions in the space of square integrable functions on a finite interval of the real line are considered. Their limiting positions are studied and described in terms of expo-polynomials.

Elicitable functionals and (strictly) consistent scoring functions are of interest due to their utility of determining (uniquely) optimal forecasts, and thus the ability to effectively backtest predictions. However, in practice, assuming…

A subset of a topological space is constructible if it is a finite Boolean combination of closed sets. We prove that every NTP$_2$ expansion of $(\mathbb{R},<,+)$ by constructible sets defines only constructible sets, and that definable…

In Chapter 3 of his Notes on constructive mathematics, Martin-L{\"o}f describes recursively constructed ordinals. He gives a constructively acceptable version of Kleene's computable ordinals. In fact, the Turing definition of computable…