General connections between quantifier elimination and decidability for first order theories are studied and exemplified.

We show that non-deterministic machines in the sense of BSS over wide classes of analytic functions are strictly more powerful then the corresponding deterministic machines.

We define diophantinely rings of algebraic integers inside their own polinomial rings using only coefficients from Z. We minimize the degree of some other diophantine definitions.