Computable Model Theory
Videos from BIRS Workshop
Antonio Montalban, University of California, Berkeley
Monday Nov 4, 2013 09:02 - 09:49
Properties on a Cone, and Sigma-Small theories
Uri Andrews, University of Wisconsin--Madison
Monday Nov 4, 2013 10:35 - 11:26
Relative recursiveness of models of a strongly minimal theory
Barbara Csima, University of Waterloo
Tuesday Nov 5, 2013 09:02 - 09:43
Degrees of Categoricity and Related Notions
Reed Solomon, University of Connecticut
Tuesday Nov 5, 2013 10:33 - 11:12
Examples of low for isomorphism degrees
Steffen Lempp, University of Wisconsin - Madison
Tuesday Nov 5, 2013 15:33 - 15:53
Some recent results on possible spectra of strongly minimal theories in infinite recursive binary relational languages
Bakhadyr Khoussainov, University of Auckland
Wednesday Nov 6, 2013 09:04 - 09:58
Computably Enumerable Structures
Vadim Puzarenko, Sobolev Institute of Mathematics (Novosibirsk)
Wednesday Nov 6, 2013 10:35 - 11:06
ℵ0 categoricity in Admissible Fragments
Russell Miller, City University of New York
Thursday Nov 7, 2013 09:03 - 10:04
The theory of fields is complete for isomorphisms
Ekaterina Fokina, Kurt Goedel Institute Vienna
Thursday Nov 7, 2013 10:34 - 10:59
Equivalance relations on computable structures
Dan Turetsky, Victoria University
Thursday Nov 7, 2013 11:04 - 11:36
Large Degree Spectra
