Logic Seminar- Effectively categorical structures

Time: Thursday, November 19, 2:00–3:00 pm

Place: Rome Hall, Room 350

Speaker: Valentina Harizanov, GWU

Title: Effectively categorical structures

Abstract: Let C be a computability-theoretic complexity class. A computable structure A is relatively C-categorical if for every isomorphic structure B there is an isomorphism from A to B, which is of complexity C relative to the atomic diagram of B. There are syntactic conditions that are equivalent to being relatively C-categorical, expressed in terms of computable infinitary formulas of certain complexity. We will focus on specific families of structures and their relative C-categoricity.