The Complexity of Index Sets of Classes of computably Enumerable Equivalence Relations

Uri Andrews, Andrea Sorbi. The Complexity of Index Sets of Classes of computably Enumerable Equivalence Relations. Journal of Symbolic Logic, 81(4):1375-1395, 2016. [doi]

Abstract

Abstract is missing.