Computability Learning Seminar

Tuesday, February 7, 2017 3:00 pm - 3:00 pm EST (GMT -05:00)

Jonny Stephenson, Department of Pure Mathematics, University of Waterloo

"Building structures and omitting types"

We will see that if we work within a sufficiently nice family of structures, then it is guaranteed to contain a computable member, which we will see how to construct. 

We adapt this construction to construct a member of the family which omits a desired sequence of universal types, provided that they are not existentially supported in the family. Under appropriate effectiveness conditions, the structure that results from this will also be computable.
 

MC 5403