In:
Journal of Symbolic Logic, Cambridge University Press (CUP), Vol. 72, No. 4 ( 2007-12), p. 1418-1432
Abstract:
This paper calculates, in a precise way. the complexity of the index sets for three classes of computable structures: the class of structures of Scott rank , the class , of structures of Scott rank , and the class K of all structures of non-computable Scott rank. We show that I(K) is m -complete is m -complete relative to Kleene's and is m -complete relative to .
Type of Medium:
Online Resource
ISSN:
0022-4812
,
1943-5886
DOI:
10.2178/jsl/1203350796
Language:
English
Publisher:
Cambridge University Press (CUP)
Publication Date:
2007
detail.hit.zdb_id:
2010607-5
SSG:
5,1
SSG:
17,1