Computability learning seminar
Sam Eisenstat, Department of Pure Mathematics, University of Waterloo
“Background for Computable Abelian Group Theory (continued)”
We finish our discussion of definitions in computable model theory, looking at the complexity of presentations of structures and isomorphisms between structures.