Publication Date:
2013-11-26
Description:
We continue recent work on computable structure theory in the setting of 1 . We prove the analogue of a result from Fokina et al. (2012 J. Symbolic Logic, 77, 122–132) saying that isomorphism of computable structures lies ‘on top’ among 1 1 equivalence relations on . Our equivalence relations are on 1 . In the standard setting, 1 1 sets are characterized in terms of paths through trees. In the setting of 1 , we use a new characterization of 1 1 sets that involves clubs in 1 . Finally, we present some new results about 1 -computable categoricity for fields.
Print ISSN:
0955-792X
Electronic ISSN:
1465-363X
Topics:
Computer Science
,
Mathematics
Permalink