Logic Seminar
Jesse Johnson
Notre Dame
Computable categoricity and quasiminimal-excellent classes.
Abstract: We will introduce some basic notions of $\alpha$-recursion as applied to computable structure theory. We will give a few easy examples of ``computable" structures and "computably categorical" structures. Using these notions, we will give a computability-theoretic analysis of quasiminimal-excellent classes. We show that for any quasiminimal-excellent class (with infinite-dimensional models) and any successor $\kappa^+ \geq \aleph_1$, the member of dimension $\kappa^+$ has a computable copy and is relatively $\Delta^0_2$-categorical. We then give precise conditions under which the member of size $\kappa^+$ is relatively-computably categorical.
Thursday April 25, 2013 at 3:00 PM in SEO 427