Dartmouth Logic Seminar

Spring 2010

Seminar this term meets Thursdays at 2:30 pm in Kemeny 008.

DateSpeakerTitle
Apr 1
Organizational Meeting
Apr 8
Marcia Groszek
Dartmouth College
Completeness and Compactness

An introduction to the Completeness and Compactness theorems, including a proof of the finitary Ramsey theorem from the infinitary Ramsey theorem using Compactness. No background will be assumed.

Slides from last year's talk (pdf).
Apr 15
Rebecca Weber
Dartmouth College
Difficult Substructures

I'll introduce computability and the construction of noncomputable sets via special Π^0_1 classes; that is, computable binary trees with infinite paths through them, but no computable infinite paths. These can be interpreted in many ways, such as the paths representing substructures of an algebraic structure, or domain elements with particular images under a function.
Apr 22
Rebecca Weber
Dartmouth College
Difficult Substructures part 2
Apr 29
Rebecca Weber
Dartmouth College
A Tour of Modern Mathematical Logic

This will be a high-level overview of the major branches of mathematical logic (proof theory, model theory, computability/recursion theory, and set theory) with the goal of briefly describing the research problems that are currently "hot" as well as some of the ways the fields interact (reverse math, computable model theory).
May 6
Rebecca Weber
Dartmouth College
A Tour of Modern Mathematical Logic part 2

We didn't get to model or set theory last week, so that will be this week's plan. No need to have been there last week to understand this week, though.
May 13
Jared Corduan
Dartmouth College
Reverse Mathematics
May 20
Canceled for thesis defense
May 27
Jared Corduan
Dartmouth College
Reverse Mathematics part 2