Howard Becker : Isomorphism of computable structures and Vaught's conjecture

Posted by Isaac Goldbring , part of the Logic Seminar.

At

March 5, 2013, 4 p.m.

In

SEO 427

Abstract

The following question in computable model theory is open: Does there exist a hyperarithmetic class of computable structures with exactly one non-hyperarithmetic isomorphism-type? Given any oracle a in 2^omega, we can ask the same question relativized to a. A negative answer for every a implies Vaught's conjecture.