Sentences over Random Groups II: Sentences of Minimal Rank
Sobhi Massalha · arXiv (Cornell University) · 2024
Random groups of density d\frac{1}{2} are finite. We prove the existence of a uniform quantifier elimination procedure for formulas of minimal rank (probably the superstable part of the theory). Namely, given a minimal rank formula V(p), we prove the existence of a formula φ(p) that belongs to the Boolean algebra of two quantifiers, so that the two formulas V(p) and φ(p) define the same set over the free group F_{k} and over a random group of density d<\frac{1}{2}. We conclude that any given sentence of minimal rank is a truth sentence over the free group F_{k} if and only if it is a truth sentence over random groups of density d<\frac{1}{2}.