Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T04:49:51.449Z Has data issue: false hasContentIssue false

Index sets for classes of high rank structures

Published online by Cambridge University Press:  12 March 2014

W. Calvert
Affiliation:
Department of Mathematics & Statistics, Murray State University, Murray, Kentucky, USA. E-mail: wesley.calvert@murraystate.edu
E. Fokina
Affiliation:
Sobolev Institute of Mathematics, Kortyug Prosr 4, 630090, Novosibirsk, Russia. E-mail: e_fokina@math.nsc.ru
S. S. Goncharov
Affiliation:
Sobolev Institute of Mathematics, Kortyug Prosr 4, 630090, Novosibirsk, Russia. E-mail: s.s.goncharov@mail.ru
J. F. Knight
Affiliation:
Department of Mathematics, University of Notre Dame, 255 Hurley Hall, Notre Dame, Indiana 46556, U.S.A.. E-mail: knight.1@nd.edu
O. Kudinov
Affiliation:
Sobolev Institute of Mathematics, Kortyug Prosr. 4, 630090, Novosibirsk, Russia. E-mail: kud@math.nsc.ru
A. S. Morozov
Affiliation:
Sobolev Institute of Mathematics, Kortyug Prosr. 4, 630090, Novosibirsk, Russia. E-mail: morozov@math.nsc.ru
V. Puzarenko
Affiliation:
Sobolev Institute of Mathematics, Kortyug Prosr. 4, 630090, Novosibirsk, Russia. E-mail: vagrig01973@mail.ru

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 .

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable