Related papers: Definability and decidability in expansions by gen…
We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…
We entirely classify definable sets up to definable bijections in $\mathbb{Z}$-groups, where the language is the one of ordered abelian groups. From this, we deduce, among others, a classification of definable families of bounded definable…
We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…
We consider d-minimal expansions of ordered fields. We demonstrate the existence of definable quotients of definable sets by definable equivalence relations when several technical conditions are satisfied. These conditions are satisfied…
In this paper we discuss several variations and generalizations of the Cantor set and study some of their properties. Also for each of those generalizations a Cantor-like function can be constructed from the set. We will discuss briefly the…
We study definably complete locally o-minimal expansions of ordered groups in this paper. A definable continuous function defined on a closed, bounded and definable set behave like a continuous function on a compact set. We demonstrate…
Dependence logic provides an elegant approach for introducing dependencies between variables into the object language of first-order logic. In [1] generalized quantifiers were introduced in this context. However, a satisfactory account was…
Let $r$ and $s$ be multiplicatively independent positive integers. We establish that the $r$-ary expansion and the $s$-ary expansion of an irrational real number, viewed as infinite words on $\{0, 1, \ldots , r-1\}$ and $\{0, 1, \ldots ,…
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…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…
It is known that the theory of any class of normed spaces over the reals that includes all spaces of a given dimension d > 1 is undecidable, and indeed, admits a relative interpretation of second-order arithmetic. The notion of a normed…
We are lifting classical problems from single instances to regular sets of instances. The task of finding a positive instance of the combinatorial problem $P$ in a potentially infinite given regular set is equivalent to the so called…
Consider $d$ disjoint closed subintervals of the unit interval and consider an orientation preserving expanding map which maps each of these subintervals to the whole unit interval. The set of points where all iterates of this expanding map…
We show that the ring of integers of $\mathbb{Q}^{\text{tr}}$ is existentially definable in the ring of integers of $\mathbb{Q}^{\text{tr}}(i)$, where $\mathbb{Q}^{\text{tr}}$ denotes the field of all totally real numbers. This implies that…
It is true in the Cohen generic extension of L, the constructible universe, that every countable ordinal-definable set of reals belongs to L.
Let $\mathcal{A}$ be a separable nuclear C*-algebra, and $\mathcal{B}$ be a nonunital separable simple $\mathcal{Z}$-stable C*-algebra. Continuing the work from Gabe-Lin-Ng, we classify all essential extensions, with large complement, of…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
Since the theory developed by Georg Cantor, mathematicians have taken a sharp interest in the sizes of infinite sets. We know that the set of integers is infinitely countable and that its cardinality is Aleph0. Cantor proved in 1891 with…
We show that if $X$ is an $m$-dimensional definable set in $\mathbb{R}^\text{pow}_\text{an}$, the structure of real subanalytic sets with real power maps added, then for any positive integer r there exists a $C^r$-parameterization of X…
We provide the first examples of finitely generated simple groups that are amenable (and infinite). This follows from a general existence result on invariant states for piecewise-translations of the integers. The states are obtained by…