Related papers: Definability and decidability in expansions by gen…

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

A classical tool in the study of real closed fields are the fields $K((G))$ of generalized power series (i.e., formal sums with well-ordered support) with coefficients in a field $K$ of characteristic 0 and exponents in an ordered abelian…

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 define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

For a commutative quantale $\mathcal{V}$, the category $\mathcal{V}-cat$ can be perceived as a category of generalised metric spaces and non-expanding maps. We show that any type constructor $T$ (formalised as an endofunctor on sets) can be…

We explore "semibounded" expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We show that if $\mathcal R=\langle R, <, +, \dots\rangle$ is a semibounded o-minimal structure and…

We begin by proving that any Presburger-definable image of one or more sets of powers has zero natural density. Then, by adapting the proof of a dichotomy result on o-minimal structures by Friedman and Miller, we produce a similar dichotomy…

It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…

We consider strong expansions of the theory of ordered abelian groups. We show that the assumption of strength has a multitude of desirable consequences for the structure of definable sets in such theories, in particular as relates to…

Let $Q=(q_n)_{n=1}^{\infty}$ be a sequence of integers greater than or equal to 2. We say that a real number $x$ in $[0,1)$ is {\it $Q$-distribution normal} if the sequence $(q_1q_2... q_n x)_{n=1}^{\infty}$ is uniformly distributed mod 1.…

We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…

The theory of $(\mathbb{R},<,+,\mathbb{Z},\mathbb{Z} a)$ is decidable if $a$ is quadratic. If $a$ is the golden ratio, $(\mathbb{R},<,+,\mathbb{Z},\mathbb{Z} a)$ defines multiplication by $a$. The results are established by using the…

Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…

We obtain a complete description for a probability measure to be doubling on an arbitrarily given uniform Cantor set. The question of which doubling measures on such a Cantor set can be extended to a doubling measure on [0; 1] is also…

Given a subset of $X\subseteq \mathbb{R}^{n}$ we can associate with every point $x\in \mathbb{R}^{n}$ a vector space $V$ of maximal dimension with the property that for some ball centered at $x$, the subset $X$ coincides inside the ball…

Concatenation hierarchies are classifications of regular languages. All such hierarchies are built through the same construction process: start from an initial class of languages and build new levels using two generic operations.…

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…

We introduce a generalization of the product expansion of a finite semigroup. As an application, we provide an alternative proof of the decidability of pointlike sets for pseudovarieties consisting of semigroups whose subgroups all belong…

A Cantor set is a non-empty, compact set that has neither interior nor isolated points. In this paper a Cantor set $K\subseteq \mathbb{R}$ is constructed such that every set definable in $(\mathbb{R},<,+,\cdot,K)$ is Borel. In addition, we…

We study semantic and syntactic properties of spherical orders and their elementary theories, including finite and dense orders and their theories. It is shown that theories of dense $n$-spherical orders are countably categorical and…