Related papers: Constructing o-minimal structures with decidable t…

<p>We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consider methods of establishing such assertions using only restricted…

The Whitney group $K_1(A)$ is isomorphic to $A^\times \times \operatorname{SK}_1(A)$ for some subgroup $\operatorname{SK}_1(A)$, where $A$ is a commutative ring and $A^\times$ denotes the set of units in $A$. Consider an o-minimal expansion…

We give an introduction to the realisation theory for infinite-dimensional systems. That is, we show that for any function $G$, analytic and bounded in the right half of the complex plane, there exists operators $A,B,C$ such that…

We prove Zilber's Trichotomy Conjecture for strongly minimal expansions of two-dimensional groups, definable in o-minimal structures: Theorem. Let M be an o-minimal expansion of a real closed field, (G;+) a 2-dimensional group definable in…

A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that…

We give an example of a non-noetherian quasi-analytic ring constructed using a quasi-analytic Denjoy-Carleman class. If we denote by $ \mathcal{D}_n$ the ring of those $ C^\infty$ quasianalytic function germs at $0\in \mathbb{R}^n$ which…

Let G be a Chevalley group scheme and B<=G a Borel subgroup scheme, both defined over Z. Let K be a global function field, S be a finite non-empty set of places over K, and O_S be the corresponding S-arithmetic ring. Then, the S-arithmetic…

Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…

We develop an axiomatic framework for fractal analysis and fractal number theory grounded in hierarchies of definability. Central to this approach is a sequence of formal systems F_n, each corresponding to a definability level S_n contained…

We prove that continuous reducibility is a well-quasi-order on the class of continuous functions between separable metrizable spaces with analytic zero-dimensional domain. To achieve this, we define scattered functions, which generalize…

We study two different types of (maximal) almost disjoint families: very mad families and (maximal) cofinitary groups. For the very mad families we prove the basic existence results. We prove that MA implies there exist many pairwise…

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…

We study groups and rings definable in d-minimal expansions of ordered fields. We generalize to such objects some known results from o-minimality. In particular, we prove that we can endow a definable group with a definable topology making…

Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation (\beta) and a quaternary equidistance relation (\equiv). Tarski established, inter alia, that the first-order…

A generalized family of transcendental (non-polynomial entire) functions is constructed, where the Hausdorff dimension and the packing dimension of the Julia sets are equal to one. Further, there exist multiply connected wandering domains,…

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 paper investigates $\exists\mathbb{R}(r^{\mathbb{Z}})$, that is the extension of the existential theory of the reals by an additional unary predicate $r^{\mathbb{Z}}$ for the integer powers of a fixed computable real number $r > 0$. If…

We determine the sets definable in expansions of the ordered real additive group by generalized Cantor sets. Given a natural number $r\geq 3$, we say a set $C$ is a generalized Cantor set in base $r$ if there is a non-empty…

We introduce the notion of an arithmetical type of combinatorial family of reals, which serves to generalize different types of families such as mad families, maximal cofinitary groups, ultrafilter bases, splitting families and other…

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…