Related papers: Definable groups for dependent and 2-dependent the…

A relevant thesis is that for the family of complete first order theories with NIP (i.e. without the independence property) there is a substantial theory, like the family of stable (and the family of simple) first order theories. We examine…

The first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary first-order theories. We prove that the first-order theory of a string automatic…

It is shown that each pseudonorm defined on a subgroup $H$ of an abelian group $G$ can be extended to a pseudonorm on $G$ such that the densities of the obtained pseudometrizable topological groups coincide. We derive from this that any…

Let K be an algebraically bounded structure and T be its theory. If T is model complete, then the theory of K endowed with a derivation, denoted by $T^{\delta}$, has a model completion. Additionally, we prove that if the theory T is…

We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…

For an infinite cardinal $\kappa$, let $ded\kappa$ denote the supremum of the number of Dedekind cuts in linear orders of size $\kappa$. It is known that $\kappa<ded\kappa\leq 2^{\kappa}$ for all $\kappa$ and that $ded\kappa<2^{\kappa}$ is…

E. Hrushovski proved that the theory of difference-differential fields of characteristic zero has a model-companion. We denote it DCFA. In this paper we study definable groups in a model of DCFA. First we prove that such a group is embeds…

We introduce $\infty$-type theories as an $\infty$-categorical generalization of the categorical definition of type theories introduced by the second named author. We establish analogous results to the previous work including the…

This paper deals with the number of subgroups of a given exponent in a finite abelian group. Explicit formulas are obtained in the case of rank two and rank three abelian groups. An asymptotic formula is also presented.

Using the description of dominions in the variety of nilpotent groups of class at most two, we give a characterization of which groups are absolutely closed in this variety. We use the general result to derive an easier characterization for…

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

We generalize two of our previous results on abelian definable groups in $p$-adically closed fields to the non-abelian case. First, we show that if $G$ is a definable group that is not definably compact, then $G$ has a one-dimensional…

We characterize all ordered Abelian groups whose first order theory in the language {+,<} is strongly dependent. The main result of this note was obtained independently by Halevi-Hasson and Farr\'e.

Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem 2). This is a variant of a prior theorem of van Benthem and…

A group is metabelian if its commutator subgroup is abelian. For finitely generated metabelian groups, classical commutative algebra, algebraic geometry and geometric group theory, especially the latter two subjects, can be brought to bear…

Let $H$ be an abelian subgroup of a finite group $G$ and $\pi$ the set of prime divisors of $|H|$. We prove that $|H O_{\pi}(G)/ O_{\pi}(G)|$ is bounded above by the largest character degree of $G$. A similar result is obtained when $H$ is…

We study the $\kappa$-Borel-reducibility of isomorphism relations of complete first order theories by using coloured trees. Under some cardinality assumptions, we show the following: For all theories T and T', if T is classifiable and T' is…

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…

Suppose that $G$ is a finite $p$-group. If all subgroups of index $p^t$ of $G$ are abelian and at least one subgroup of index $p^{t-1}$ of $G$ is not abelian, then $G$ is called an $\mathcal{A}_t$-group. In this paper, some information…

We note a parallel between some ideas of stable model theory and certain topics in finite combinatorics related to the sum-product phenomenon. For a simple linear group G, we show that a finite subset X with |X X \^{-1} X |/ |X| bounded is…