Computability Learning Seminar

Mohammad Mahmoud, Department of Pure Mathematics, University of Waterloo

“Coding Sets and R.i. notions”

This week we finish chapter 1 of the book by talking about finite structures and approximations then giving a sketch of Knight’s result about the degree spectrum of a structure. After that we move to chapter 2 and introduce some Relatively intrinsic notions. Basically we dis- cuss R.i.c.e. (relatively intrinsic computably enumerable) relations and give some examples. Our goal is to prove a characterization theorem for R.i.c.e. relations.

MC 5417