Logical Complexity of Schanuel's Conjecture
Speaker:
David Marker, University of Illinois at Chicago
Date and Time:
Tuesday, August 2, 2016 - 3:30pm to 4:30pm
Location:
Fields Institute, Room 230
Abstract:
At first glance, Schanuel's Conjecture is a statement in second order arithmetic with quantification over the complex numbers. A contributor to FOM asked if there was an equivalent arithmetic statement. I'll show that there is a natural $\Pi^0_3$ formulation and that, with a few tricks, this can be reduced to $\Pi^0_2$. These observations arose in an e-mail correspondence with Lou van den Dries and Angus Macintyre.