Computable stability theory

August 12 to August 16, 2013

at the

American Institute of Mathematics, Palo Alto, California

organized by

Uri Andrews, Julia F. Knight, and Michael Laskowski

Original Announcement

This workshop will be devoted to the interplay between stability theory and computable model theory.

In its formative stages, much of the development of model theory was motivated by questions of computability of structures or theories, so model theory and computable model theory were two sides of the same developing theory. Over the course of the last few decades, the topics have grown rather separate, but in recent years, computable model theory has begun to form several connections with modern model theory. These connections use structural results from stability theory to bound computability of structures or models, and in many cases have also lead to a better understanding of the structure of the models. In this workshop, we hope to further develop this connection, especially in the following areas.

The main topics of the workshop are:

  1. Automatic quantifier elimination
  2. Fraisse limits and related constructions
  3. Complexity of embeddings
A further goal of this workshop will be to initiate discussion and collaboration on open problems between members of the model theory and computability theory communities.

Material from the workshop

A list of participants.

The workshop schedule.

A report on the workshop activities.

A list of open problems.