Skip to main content
×
Home
    • Aa
    • Aa

Index sets for classes of high rank structures

  • W. Calvert (a1), E. Fokina (a2), S. S. Goncharov (a3), J. F. Knight (a4), O. Kudinov (a5), A. S. Morozov (a6) and V. Puzarenko (a7)...
Abstract
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 .

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 3 *
Loading metrics...

Abstract views

Total abstract views: 69 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 22nd October 2017. This data will be updated every 24 hours.