Computability Theory

Computability is one of the fundamental notions of mathematics, trying to capture the effective content of mathematics. Starting from Gödel’s Incompleteness Theorem, it has now blossomed into a rich area with strong connections with other areas of mathematical logic as well as algebra and theoretical computer science

Local interdefinability of Weierstrass elliptic functions

We explain which Weierstrass elliptic functions are locally definable from other elliptic functions and exponentiation in the context of o-minimal structures. The proofs make use of the predimension method from model theory to exploit functional transcendence theorems in a systematic way