Computability Learning Seminar

Jonny Stephenson, Department of Pure Mathematics, University of Waterloo

"Effective bi-interpretability and Graphs II"

Last time we saw that every structure is effectively bi-interpretable with a structure over a simple language consisting of a unary predicate U and a symmetric binary predicate E. This week, we will show that any structure over this language is effectively bi-interpretable with a graph. This will complete the proof that every structure is effectively bi-interpretable with a graph.

MC 5403