Title: Limit computably categorical structures
Speaker: Valentina Harizanov, GWU
Date and Time: Friday, October 26 2018, 01:00pm-02:00pm
Place: Rome Hall (801 22nd Street), Room 771
Abstract: We say that a computable structure is limit computably categorical if for every isomorphic computable structure there is an isomorphism that is computable in the halting set. This notion can be further generalized, and there is a natural connection with definability using computable infinitary formulas. We will investigate limit computably categorical structures from some familiar classes, although such characterization is not known even for linear orders, trees of finite height, equivalence structures, or abelian p-groups.