Universal theories for free solvable groups.
A group \(G\) has a decidable universal theory if there is an algorithm which decides whether or not a universal sentence is true in \(G\). \textit{O. Chapuis} proved [in J. Algebra 176, No. 2, 368-391 (1995; Zbl 0860.20024)] that free metabelian groups, as well as groups close to these, have decidable universal theories. It is proved in the paper under review that a free solvable group of rank \(\geq 2\) of derived length at least 4 has undecidable universal theory. A similar question about a free solvable group of derived length 3 is still open.
- On the theories of free solvable groups
- Algebraic geometry over algebraic structures. VI: Geometrical equivalence
- Theories of relatively free solvable groups with extra predicate
- Universal theory of certain solvable groups and bounded Ore group rings
- Groups universally equivalent to the solvable Baumslag-Soliter group
- On the universal theories of generalized rigid metabelian groups
- Logical aspects of the theory of divisible rigid groups.
- On the existence of universal rational structures for groups.
- Universal theory of a free polynilpotent group
- ∀-free metabelian groups
- scientific article; zbMATH DE number 1564067 (Why is no real title available?)
- scientific article; zbMATH DE number 1746554 (Why is no real title available?)
- scientific article; zbMATH DE number 1445259 (Why is no real title available?)
- On the Universal Theory of Torsion and Lacunary Hyperbolic Groups
- Universal theories for rigid soluble groups.
This page was built for publication: Universal theories for free solvable groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928481)