Affiliations: [a] School of Mathematical and Statistical Sciences, Mail Code 4408, Southern Illinois University, 1245 Lincoln Drive, Carbondale, Illinois 62901, USA | [b] Department of Mathematics, University of Florida, Gainesville, FL 32611, USA | [c] Department of Mathematics, George Washington University, Washington, DC 20052, USA
Abstract: Inspired by the study of generic and coarse computability in computability theory, we extend such investigation to the context of computable model theory. In this paper, we continue our study initiated in the previous paper (Journal of Logic and Computation 32 (2022) 581–607) , where we introduced and studied the notions of generically and coarsely computable structures and their generalizations. In this paper, we introduce the notions of generically and coarsely computable isomorphisms, and their weaker variants. We sometimes also require that the isomorphisms preserve the density structure. For example, for any coarsely computable structure A, there is a density preserving coarsely computable isomorphism from A to a computable structure. We demonstrate that each notion of generically and coarsely computable isomorphisms, density preserving or not, gives interesting insights into the structures we consider, focusing on various equivalence structures and injection structures.