Categoricity and generalized model completeness
The author proves that if T is \(\aleph_ 0\)-categorical and almost strongly minimal then T has a finite definitional extension which is model complete (T is said to be almost model complete). In addition such a T is axiomatizable by sentences of bounded quantifier complexity.
sentences of bounded quantifier complexity
scientific article; zbMATH DE number 4037824