[Alta-Logic] Logic Talk: Julia Knight (Notre Dame). Friday Nov 8, 3 pm.

[Richard Zach]

  How hard is it to compute the floor function?


  Start: Nov 8 2013 - 3:00pm End: Nov 8 2013 - 4:00pm


Speaker:

Dr. Julia Knight, Notre Dame University

Location:
MS 431

*Abstract:*  For the field of real numbers, we have the usual 
floor function, with range equal to the set of integers.  If we expand 
the reals, adding the function 2^x, then for a positive integer x, 2^x 
is also a positive integer.  Mourgues and Ressayre showed that every 
real closed field has an ``integer part''.  The construction is 
complicated.  Ressayre showed that every real closed exponential field 
has an ``exponential integer part''.  This construction is even 
more complicated.  The talk will describe results on the complexity of 
  these constructions, from the point of view of computable structure 
theory.

*Bio:*  Dr. Julia Knight is the Charles L. Huisking Professor of 
Mathematics at the University of Notre Dame.  She is an AMS Fellow, has 
been a Fellow at the Newton Institute, holds an Honorary Professorship 
with the Siberian Branch of the Russian Academy of Sciences, has won the 
Silver Badge of Algebra and Logic, and won the James A. Burns, CSC, 
  Graduate School Award in 2007 for her exemplary contribution to 
graduate education.  She is the Editor of the AMS Proceedings and serves 
on the AMS Committee on Academic Freedon, Tenure and Employment 
Security, the AMS Fellows selection committee,  and the Association for 
Symbolic Logic Nominating Committee.  Dr. Knight is visiting Calgary en 
route from a BIRS workshop on computable model theory.




-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.ucalgary.ca/pipermail/alta-logic-l/attachments/20131107/e6d3c74c/attachment.html