Definition 12.2 (Constructible). Let F be a field. We say that X⊆Fn is constructible if it is a boolean combination of subsets of Fn defined by p(x1,…,xn)=0 for p(x¯)∈F[x¯].