Model Theory Seminar

David Marker, University of Illinois at Chicago

"Logical Complexity of Schanuel's Conjecture"

Schanuel's Conjecture is naturally a \Pi^1_1-statement.  We show that it is equivalent to a \Pi^0_3-statement in arithmetic by showing that if there are counterexamples, then there are computable counterexamples.  The main ideas come from the work of Johnathan Kirby on exponential algebraic closure and exponential derivations.

MC 5403