Related papers: A report on Tarski's decidability problem
This is the first in a planned series of papers giving an alternate approach to Zlil Sela's work on the Tarski problems. The present paper is an exposition of work of Kharlampovich-Myasnikov and Sela giving a parametrization of Hom(G,F)…
In 2006 Z. Sela and independently O. Kharlampovich and A. Myasnikov gave a solution to the Tarski problems by showing that two non-abelian free groups have the same elementary theory. Subsequently Z. Sela generalized the techniques used in…
The Tarski number of a non-amenable group G is the minimal number of pieces in a paradoxical decomposition of G. In this paper we investigate how Tarski numbers may change under various group-theoretic operations. Using these estimates and…
We give a complete classification of finitely generated virtually free groups up to $\forall\exists$-elementary equivalence. As a corollary, we give an algorithm that takes as input two finite presentations of virtually free groups, and…
We give a description of definable sets $P=(p_1,..., p_m)$ in a free non-abelian group $F$ and in a torsion-free non-elementary hyperbolic group $G$ that follows from our work on the Tarski problems. This answers Malcev's question for $F$.…
Tkachenko and Yaschenko [34] characterized the abelian groups G such that all proper unconditionally closed subsets of G are finite, these are precisely the abelian groups G having cofinite Zariski topology (they proved that such a G is…
We prove that every nonabelian free group has a finitely generated isolated subgroup which is not separable in the class of nilpotent groups. This enables us to give a negative answer to the following question by D.I. Moldavanskii in the…
It is shown that the knapsack problem (introduced by Myasnikov, Nikolaev, and Ushakov) is undecidable in a direct product of sufficiently many copies of the discrete Heisenberg group (which is nilpotent of class 2). Moreover, for the…
We present a version of G\"odel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions. We also argue that…
We show that (with one possible exception) there exist strongly dense free subgroups in any semisimple algebraic group over a large enough field. These are nonabelian free subgroups all of whose subgroups are either cyclic or Zariski dense.…
In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also…
This paper is the 10th in a sequence on the structure of sets of solutions to systems of equations over groups, projections of such sets (Diophantine sets), and the structure of definable sets over few classes of groups. In the 10th paper…
We give a solution stated in the title to problem 3 of part 1 of the problems listed in the book of Eklof and Mekler [EM],(p.453). There, in pp. 241-242, this is discussed and proved in some cases. The existence of strongly lambda-free ones…
Morrill and Valentin in the paper "Computational coverage of TLG: Nonlinearity" considered an extension of the Lambek calculus enriched by a so-called "exponential" modality. This modality behaves in the "relevant" style, that is, it allows…
We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…
We consider semigroup algorithmic problems in finitely generated metabelian groups. Our paper focuses on three decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain a neutral…
We prove the decidability of the elementary theory of a free group.
We answer a long-standing open question by proving in ordinary set theory, ZFC, that the Kaplansky test problems have negative answers for aleph_1-separable abelian groups of cardinality aleph_1. In fact, there is an aleph_1-separable…
We prove that non-abelian free groups of finite rank at least 3 or of countable rank are not $\forall$-homogeneous. We answer three open questions from Kharlampovich, Myasnikov, and Sklinos regarding whether free groups, finitely generated…
The original version of the paper was published in Contemporary Mathematics 378 ``Groups, Languages, Algorithms''; 2005, pp. 319-348. This is a modified version with Appendix that holds a corrected formulation of Proposition 4.1.