What is the common theory of all finite fields equipped with an additive and/or multiplicative character? Hrushovski answered this question in the additive case working in (a mild version of) continuous logic.
Motivated by natural number-theoretic examples we generalise his results to the case allowing for both (non-trivial) additive character and (sufficiently generic) multiplicative character.
Apart from answering the above question we obtain a quantifier elimination result and a generalisation of the definability of the Chatzidakis-Macintyre-van den Dries counting measure to this context.
The proof relies on classical results on bounds of character sums following from the work of Weil.
|