Publication:3880806
From MaRDI portal
zbMath0439.03003MaRDI QIDQ3880806
Publication date: 1979
Zariski topology; constructible set; definability bounds; first order theories of algebraically closed fields; prenex first order formula
03B25: Decidability of theories and sets of sentences
03D15: Complexity of computation (including implicit computational complexity)
14A10: Varieties and morphisms
03D10: Turing machines and related notions
Related Items
Definability and fast quantifier elimination in algebraically closed fields, The complexity of partial derivatives