Louise Hay Logic Seminar
Matthew DeVilbiss
UIC
Decidability and elementary geometry
Abstract: In the infancy of model theory, Tarski proved that elementary Euclidean geometry is decidable, i.e. there is an algorithm that decides the truth or falsehood of all first-order sentences pertaining to this geometry. While this is fairly well known, it seems the proof is far more obscure. In this talk, I will elaborate on this proof.
Depending on how that goes, I might also talk about elementary hyperbolic.
Thursday March 22, 2018 at 4:00 PM in SEO 427