Kourovka Notebook Problem 21.106
Statement
A first order formula in the group language with one free variable is said to be concise in a class of groups if for every group in such that the set of elements in satisfying is finite, the subgroup generated by is also finite. Is every formula with one free variable concise in the class of residually finite groups?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.