University Seminar- Computability, Complexity, and Algebraic Structure

Time: Wednesday, March 27, 11:15am – 12:15pm

Place: Phillips Hall, Room 109

Speaker:  Henry Klatt, GWU

Title: n-generic and more: how far can forcing take us?

Abstract:  Forcing is a powerful and fundamental tool in computability theory.  Forcing allows us to construct so called “generic” sets, whose theories are reducible to a conjunction of their decision problem, and a general theory of generic sets called the forcing relation.  In this talk, we will define the forcing relation for arithmetical and hyper-arithmetical relations.  We will also discuss forcing for models of ramified analysis, and philosophise on if it is possible to push forcing further to analytical statements.