| Résume |
I will discuss theories of global fields in a language with multiplication replaced by scalar multiplication and predicates for one or several absolute values. Extending results of van den Dries, in joint work with Pierre Touchard we classify which of these theories are decidable. I will also discuss the computational complexity of fragments of some of these theories, studied in joint work with Manuel Bodirsky.
|
