Computability Learning Seminar | Beining Mu | Goncharov's theorem and application

Beining Mu (University of Waterloo)

Goncharov's theorem and application

In this seminar, we will prove Goncharnov's theorem, which states that there is a structure which is computably categorical but not relatively so. Then we will proof its application in computable structure theory. In particular, we will relativize Goncharnov's theorem to \(\emptyset'\)

MC 5403