lempptalks

The computable model theory of uncountably categorical models

Steffen Lempp

Abstract:
I will discuss a recent joint result with Goncharov, Harizanov,
Laskowski and McCoy, exhibiting a close connection between the classical and
the computable model theory of uncountably categorical models. The final
result, a purely model-theoretic theorem, arose from a question of mine in
computable model theory, and has since led to more interesting model-theoretic
work.

Suggested reading:
my two joint papers on applications of computability theory to model theory
("Trivial ..." and "Constructive ..."  available at this link
 and all the papers referred to therein

Page modified: 02-Jun-2005, © 2017 Victoria University of Wellington, NZ