Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

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)

What did Tarski mean with "elementary Geometry is decidable"?

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login