Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, February 08, 2005, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Johann A. Makowsky (Technion, Haifa)
In 1931 Tarski proved the existence of an elimination of quantifiers algorithm for the first order theory of real closed fields. It follows that the first order theory of the reals as an ordered field is decidable. In 1951 and later, Tarski interpreted this result as the decidability of elementary geometry. However, he was aware that it did not clarify the issue of decidability, when all models of Euclidean geometry are taken into account.
In 1980 M. Ziegler proved that the first order theory of pythagorean and euclidean fields is undecidable. This implies that the first order theory of text book geometry is undecidable. In this talk we clarify the situation, and discuss the (un)decidability of various parts of euclidean geometry.
Automatic MiSe System Software Version 1.4803M | admin login