Welcome to New York Logic!
|Mar 7 Friday||Mar 8 Saturday||Mar 9 Sunday||Mar 10 Monday||Mar 11 Tuesday||Mar 12 Wednesday||Mar 13 Thursday|
Mar 7, 201410:00 am
Mar 7, 201412:30 pm
Mar 7, 20142:00 pm
Mar 10, 20146:30 pm
→ go to the Calendar
Upcoming talks and events:
In his 1976 paper Haim Gaifman proved that for every set I, every model M of PA has an elementary end extension N such that Lt(N/M) is isomorphic to P(I). I will present a proof.
The dynamical and descriptive set theoretic complexity of a countable Borel equivalence relation E can often be understood in terms of the kinds of countable first order structures which are compatible with E in a suitable sense. In this talk I will make this suitable sense precise by discussing the notion of Borel structurability. I will also discuss some recent joint work with Brandon Seward in which we show that the equivalence relation generated by the free part of the translation action of a countable group G on its powerset is structurably-universal among equivalence relations generated by free Borel actions of G.
In 1936, only a few years after the incompleteness theorems were proved, Gentzen proved the consistency of Peano arithmetic by using transfinite induction up to the ordinal epsilon_0. I will give a short proof of the result, based on on the simplification introduced by Schutte, and discuss some of the consequences.
The spring NERDS meeting this year will take place on Sunday, March 30, 2014, from 11 am until 4 pm, at Olin College in Needham, MA, fifteen miles west of Boston. Directions are available here. Further details will be posted when available, including speakers and titles of talks. NERDS is a one-day meeting on computability theory which takes place twice a year, at assorted sites throughout New England.