Matthew DeVilbiss : Decidability and elementary geometry

Posted by Matthew DeVilbiss , part of the Louise Hay Logic Seminar.

At

March 22, 2018, 4 p.m.

In

SEO 427

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.