Computability Learning Seminar

Jonny Stephenson, Pure Mathematics, University of Waterloo

"The back-and-forth property and uniform computable categoricity"

Cantor's back-and-forth argument gives a condition allowing one to construct isomorphisms between different copies of mathematical structures by a process of finite extension. We will give a condition which shows when such a procedure can be carried out, as well as demonstrating a link between back-and-forth procedures, effective atomicity, and uniform computable categoricity of structures.

MC 5403