## Graduate Student Seminar-Priority Argument Constructions for Graphs and Trees

**Title**: Priority Argument Constructions for Graphs and Trees**Speaker**:Hakim Walker, GWU**Date and Time:** Friday March 31, 3:00-4:00**Place:** Rome 352

**Abstract:** In computable model theory, we study the algorithmic content and properties of classical mathematical structures, such as groups, vector spaces, linear orders, etc. In particular, one area that we examine is the computational complexity of additional relations on the structures, as well as isomorphisms between structures. It is usually the case that while a structure itself is computable, additional relations on the structure are not computable. Also, we often have two computable structures that are isomorphic to each other but have no computable isomorphism between them. One of the most common ways to demonstrate these non-computable properties is to use a priority argument, which is a generalization of Cantor's diagonal argument.