Strongly minimal theories with recursive models (Q1644487)

A complete first-order theory \(T\) is called strongly minimal if for every its model \(\mathcal M\) and every formula \(\varphi(\bar a,x)\) with \(\bar a\) in \(\mathcal M\), the set \(\{b\mid\mathcal M\models\varphi(\bar a,b)\}\) is finite or co-finite. A \(B_n\)-formula is a Boolean combination of \(\exists_n\)-formulas. A \(B_n\)-type is the set of \(B_n\)-formulas in a complete type. A model \(\mathcal M\) is \(n\)-saturated if for all \(\bar a\) in \(\mathcal M\), every \(B_n\)-type \(p(\bar a,x)\) consistent with the type of \(\bar a\) is realized in \(\mathcal M\). A model \(\mathcal M\) is boundedly saturated if it is \(n\)-saturated for all \(n\). A dimension of a model \(\mathcal M\) is the size of a maximal algebraically independent set in \(\mathcal M\). The main result of the paper is as follows: if \(T\) is a strongly minimal theory and its \(\exists_{n+2}\)-fragment is \(\Delta^0_n\) uniformly in \(n\), then every countable model \(\mathcal M\) has a computable copy. In the proof, the following four cases are considered separately: 1) there exists \(N\) such that \(T\) is \(\Delta^0_N\) and \(\mathcal M\) is \(N\)-saturated; 2) \(\mathcal M\) is not \(N\)-saturated for some \(N\), and \(T\) may be arithmetical or not; 3) \(T\) is not arithmetical and \(\mathcal M\) is saturated; 4) \(T\) is not arithmetical and \(\mathcal M\) is boundedly saturated but of finite dimension. The main result, relativized to \(\emptyset^{(3)}\), gives the following Corollary: If \(T\) is a strongly minimal theory with a recursive model, then every countable model of \(T\) has a \(\Delta^0_4\) copy.