# Recent and upcoming talks by John Clemens

## John Clemens: The recursion theorem in set theory

Tuesday, September 27 from 3 to 4pm Room: MB 124 Speaker: John Clemens (BSU) Title: The Recursion Theorem in Set Theory Abstract: Kleene’s Recursion Theorem is a simple yet powerful result about computable functions, which asserts the existence of functions which “know their own code” in some suitably nice enumeration of the computable functions. continue reading…

## John Clemens: Isomorphism of homogeneous structures

Wednesday, September 16 from 3 to 4pm Room: MP 207 Speaker: John Clemens (BSU) Title: Isomorphism of homogeneous structures Abstract: The theory of Borel reducibility of equivalence relations can be used to gauge the complexity of the isomorphism problem for a collection of countable structures. continue reading…

## 6th Descriptive Set Theory in Paris, December 16 – 17, 2013

The sixth meeting Descriptive Set Theory in Paris  organized by the Equipe d’Analyse Fonctionnelle will be held on December 16 and 17, 2013 at the Institut de Mathématique de Jussieu. List Of Speakers Itai BEN YAACOV John CLEMENS Sy FRIEDMAN Vassilis GREGORIADES Adriane KAÏCHOUH David KERR Aleksandra KWIATKOWSKA François LE MAITRE Luca MOTTO ROS Lionel NGUYEN VAN THE Marcin SABOK Omar SELIM Konstantin SLUTSKY Slawomir SOLECKI Asger TORNQUIST Anatoly VERSHIK Titles and Abstracts continue reading…

## John Clemens: Treeable equivalence relations and descriptive complexity

Monday, May 14, 2012, 16.30 Speaker: John Clemens (University of Münster) Title: Treeable equivalence relations and descriptive complexity Abstract: The property of treeability has been well-studied in the context of countable Borel equivalence relations, but has been little studied up to now in the uncountable case. continue reading…