[FOM] 2nd announcement: Foundational Impact of Recursion Theory - May 22, 2016

Mummert, Carl mummertc at marshall.edu
Wed Apr 13 09:17:28 EDT 2016


Second Announcement:

FOUNDATIONAL IMPACT OF RECURSION THEORY 

A conference in honor of Steve Simpson's 70th birthday.

A one-day conference will be held at the University of Connecticut, Storrs on May 22, 2016, the day before the Association of Symbolic Logic meeting at the same location.  The goal of the conference is to bring together researchers working in all aspects and foundational applications of recursion theory. 

Complete information is available on the conference webpage, 

   http://www.marshall.edu/math/FIRT16/

There is no registration fee, but we ask participants to register online by May 1, 2016. There will be a conference dinner following the conference; the cost will be announced.  Additional information is available from any of the organizers: Jeff Hirst (hirstjl at appstate.edu), Alberto Marcone (alberto.marcone at uniud.it), and Carl Mummert (mummertc at marshall.edu). 


SPEAKERS AND TITLES OF TALKS

Abstracts and the schedule of talks are available on the conference webpage. 

* François Dorais, University of Vermont, 
"Set-theoretic interpretations below $ATR_0$"

* Stephen Flood, Bridgewater State University,
“The Logic of Graph Decompositions” 

* Carl Jockusch, University of Illinois at Urbana-Champaign 
“Effectiveness and strength of Hindman's theorem for bounded sums”

* Antonio Montalbán, University of California - Berkeley, 
“Many-one degrees with names like John or Paul” 

* Ludovic Patey, Université Paris Diderot (VII), 
“The weakness of Ramsey's theorem under omniscient reductions”

* Gerald Sacks, Massachusetts Institute of Technology, 
“Non-Enumerability of $L$” 

* Paul Shafer, University of Ghent,
“A tour of the mass problems” 

* Richard Shore, Cornell University,
“The Muchnik degrees of nonempty $\Pi^0_1$ classes are dense”

* Ted Slaman, University of California - Berkeley, 
“Recursion Theory and Diophantine Approximation”




More information about the FOM mailing list