Related papers: Exponential-constructible functions in $P$-minimal…
We prove that all known examples of weakly o-minimal non-valuational structures have no definable Skolem functions. We show, however, that such structures eliminate imaginaries up to (definable families of) definable cuts. Along the way we…
This manuscript introduces the idea of GS-exponential kind of convex functions and some of their algebraic features, and we introduce a new class GS-exponential kind of convex sets. In addition, we describe certain fundamental…
In this article we give strong versions for preparation theorems for $\mathbb{R}_{an,exp}$-definable functions outgoing from methods of Lion and Rolin ($\mathbb{R}_{an,exp}$ is the o-minimal structure generated by all restricted analytic…
We study sets and groups definable in tame expansions of o-minimal structures. Let $\mathcal {\widetilde M}= \langle \mathcal M, P\rangle$ be an expansion of an o-minimal $\mathcal L$-structure $\cal M$ by a dense set $P$, such that three…
We call a function "constructible" if it has a globally subanalytic domain and can be expressed as a sum of products of globally subanalytic functions and logarithms of positively-valued globally subanalytic functions. Our main theorem…
The paper examines the construction and analysis of a new class of mixed exponential statistical structures that combine the properties of stochastic models and linear positive operators. The relevance of the topic is driven by the growing…
We develop a method to construct elusive functions using techniques of commutative algebra and algebraic geometry. The key notions of this method are elusive subsets and evaluation mappings. We also develop the effective elimination theory…
We extend the theory of Euler integration from the class of constructible functions to that of "tame" real-valued functions (definable with respect to an o-minimal structure). The corresponding integral operator has some unusual defects (it…
This article is first in a series of papers where we reprove the statements in constructing the Enhanced Operation Map and the abstract six-functor formalism developed by Liu-Zheng. In this paper, we prove a theorem regarding constructing…
In this paper we introduce constructible analogs of the discrete complexity classes $\mathbf{VP}$ and $\mathbf{VNP}$ of sequences of functions. The functions in the new definitions are constructible functions on $\mathbb{R}^n$ or…
We prove that one may approximate parametric suprema of constructible and power-constructible functions using functions within the same class. This resolves a conjecture by Adiceam and Cluckers, which was posited after studying a question…
Let X in V be a closed embedding, with V - X nonsingular. We define a constructible function on X, agreeing with Verdier's specialization of the constant function 1 when X is the zero-locus of a function on V. Our definition is given in…
Exponentiable functors between quantaloid-enriched categories are characterized in elementary terms. The proof goes as follows: the elementary conditions on a given functor translate into existence statements for certain adjoints that obey…
In this article we define restricted log-exp-analytic functions as compositions of log-analytic functions and exponentials whose logarithm are locally bounded. We prove that the derivative of a restricted log-exp-analytic function is again…
We study a new notion of reduction between structures called enumerable functors related to the recently investigated notion of computable functors. Our main result shows that enumerable functors and effective interpretability with the…
This is a thesis that was defended in 2009 at Lomonosov Moscow State University. In Chapter 1: 1. It is proved that that the class of lower (Skolem) elementary functions is the set of all polynomial-bounded functions that can be obtained by…
We call a function constructible if it has a globally subanalytic domain and can be expressed as a sum of products of globally subanalytic functions and logarithms of positively-valued globally subanalytic functions. For any $q > 0$ and…
This dissertation introduces executable refinement types, which refine structural types by semi-decidable predicates, and establishes their metatheory and accompanying implementation techniques. These results are useful for undecidable type…
We describe a class of sharply o-minimal structures, called analytically generated structures, whose definable sets and their complexity filtration are determined by the collection of definable complex cells. We prove a polynomially…
In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…