Related papers: Equations in a free group. Elementary theory
It was proved by Sela and by the authors that every formula in the theory of a free group $F$ is equivalent to a boolean combination of $\exists\forall$-formulas. We also proved that the elementary theory of a free group is decidable (there…
This paper is devoted to the proof of the property of order separability for free product of free groups with maximal cyclic amalgamated subgroups.
We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which forces a contradiction.
In this version small mistakes are corrected and the exposition is changed as suggested by the referee (to appear in Canadian Journal of Mathematics). The first main result of the paper is a criterion for a partially commutative group $\GG$…
We prove that if a countable group is elementarily equivalent to a non-abelian free group and all of its abelian subgroups are cyclic, then the group is a union of a chain of regular NTQ groups (i.e., hyperbolic towers).
We describe solutions to the problem of elementary classification in the class of group algebras of free groups. We will show that unlike free groups, two group algebras of free groups over infinite fields are elementarily equivalent if and…
In this paper, we will prove some sufficient conditions for the solvability of groups.
We construct the free products of arbitrary digroups, and thus we solve an open problem of Zhuchok.
In this paper we give a complete algebraic description of groups elementarily equivalent to a given free nilpotent group of finite rank.
Let $F$ be a free group of finite rank. We say that the monomorphism problem in $F$ is decidable if for any two elements $u$ and $v$ in $F$, there is an algorithm that determines whether there exists a monomorphism of $F$ that sends $u$ to…
In this paper we prove undecidability of finite systems of equations in free Lie algebras of rank at least three over an arbitrary field. We show that the ring of integers $\mathbb{Z}$ is interpretable by positive existential formulas in…
We prove an analogue of the fixed-point theorem for the case of definably amenable groups.
It is known that the existential theory of equations in free groups is decidable. This is a famous result of Makanin. On the other hand it has been shown that the scheme of his algorithm is not primitive recursive. In this paper we present…
In [6] we proved that the universal theory of infinite free lattices is (algorithmically) decidable, leaving open the problem of decidability of the full theory of an (infinite) free lattice. We solve this problem by proving that, for every…
We show that the universal theory of torsion groups is strongly contained in the universal theory of finite groups. This answers a question of Dyson. We also prove that the universal theory of some natural classes of torsion groups is…
We continue our work on the model theory of free lattices, solving two of the main open problems from our first paper on the subject. Our main result is that the universal (existential) theory of infinite free lattices is decidable. Our…
The known facts about solvability of equations over groups are considered from a more general point of view. A generalized version of the theorem about solvability of unimodular equations over torsion-free groups is proved. In a special…
We consider embeddings in a torsion-free hyperbolic group which are elementary in the sense of first-order logic. We give a description of these embeddings in terms of Sela's hyperbolic towers. We deduce as a corollary that subgroups…
We introduce the notion of a regular quadratic equation and a regular NTQ system over a free group. We prove the results that can be described as Implicit function theorems for algebraic varieties corresponding to regular quadratic and NTQ…
A group is called square-like if it is universally equivalent to its direct square. It is known that the class of all square-like groups admits an explicit first order axiomatization but its theory is undecidable. We prove that the theory…