For more information about this meeting, contact Stephen Simpson.
|Title:||Incompleteness and undecidability|
|Speaker:||Stephen G. Simpson, Pennsylvania State University|
|Let Q be Robinson's weak theory of arithmetic. We use recursion-theoretical methods to show that Q is essentially undecidable. Consequently, any recursively axiomatizable theory in which Q is interpretable is undecidable and incomplete. This is a strong version of Goedel's First Incompleteness Theorem.|
Room Reservation Information
|Date:||11 / 18 / 2008|
|Time:||02:30pm - 03:45pm|