Logic Seminar
Sara Quinn
Northwestern University
Back and Forth Through Equivalence Structures
Abstract: In this talk I will give evidence that the standard back-and-forth relations are a powerful tool in computable structure theory. I will give all necessary background and definitions, and then give two results on equivalence structures that can be proved using the back-and-forth relations. These two results are from my dissertation, and involve index set complexity, Scott sentences, and Turing computable embedding.
seminar begins with tea
Tuesday March 10, 2009 at 4:00 PM in SEO 612