Computability Learning Seminar

Michael Deveau, Department of Pure Mathematics, University of Waterloo

"Isomorphisms that cannot be coded by computable relations -- Part 2"

Last time, we saw why it is so useful to code an isomorphism by the image of a computable relation and also explored some cases where this is always possible. We now turn to constructing a pair of structures where this is not possible. That is, we construct two structures -- isomorphic to $(\omega, <)$ -- where this method of establishing the degree of the isomorphism between them will not work.

MC 5413