University Seminar: Logic Across Disciplines- Isomorphism problem 

Title: Isomorphism problem
Speaker: Valentina Harizanov, GWU-
Date and time: Friday, November 1, 11:00am-12 noon
Place: Phillips Hall (801 22nd Street), Room 736

Abstract: We consider the computable isomorphism problem, given by the set of pairs of codes for computable isomorphic structures. The complexity is measured using the notion of completeness within a suitable computability-theoretic complexity class.