Dartmouth Logic Seminar

All Terms

Spring 2014
Winter 2014
Fall 2013
Spring 2013
Winter 2013
Fall 2012
Spring 2012
Winter 2012
Fall 2011
Spring 2011
Winter 2011
Fall 2010
Spring 2010
Spring 2009
Spring 2008
Winter 2008
Fall 2007
Summer 2007
Spring 2007
Winter 2007
Fall 2006
Summer 2006
Spring 2006
Winter 2006
Fall 2005

Regional Logic Links

Connecticut Logic Seminar
Logic at Harvard
Logic at MIT
New England Recursion and Definability Seminar
New York Logic
UConn Logic Group

Association for Symbolic Logic


Find us on Google+

Contact the Webmaster

Winter 2007

Logic seminar will run only for the month of January as many of the logicians will be at the University of Florida at Gainesville for the months of February and March. Rebecca Weber has offered to give a series of logic talks, not requiring much background in logic, to interested graduate students. Please contact her to find out more information.

Seminar this term will meet Wednesdays at 4:00 pm in Kemeny 108.

DateSpeakerTitle
Jan 17
Jared Corduan
Dartmouth College
 Goedel's Incompleteness Theorem
Jan 24
Rebecca Weber
Dartmouth College
 Randomness for closed subsets of $2^{\omega}$
Mar 7
Rebecca Weber
Dartmouth College
 Achieving noncomputable ends by computable means.

Is it possible to construct a noncomputable object computably? A central theme of computability (recursion) theory is working with incomplete information: a sequence of approximations guaranteed to be correct at some finite but unknown stage. This requires acting on speculation, knowing mistakes will be made, and setting up the construction so the mistakes may be overcome. We will survey some of these constructions. No logic background will be assumed.