Logic seminar
Wed, 30 March, 2016
9:30pm
Speaker: Johanna Franklin, Hofstra University, NY
https://people.hofstra.edu/
Title: Category and lowness for isomorphism
Abstract: A Turing degree d is said to be low for isomorphism if, whenever two structures are d-isomorphic, they are already computably isomorphic. Solomon and I proved that every 2-generic Turing degree was low for isomorphism and hypothesized that no weaker level of genericity would suffice. However, Turetsky and I constructed a properly 1-generic real that is low for isomorphism. In this talk, I will present proofs of both of these results.