Index sets for classes of high rank structures-Reference-Cited by-同舟云学术

Index sets for classes of high rank structures

Published:2007-12 Issue:4 Volume:72 Page:1418-1432
ISSN:0022-4812
Container-title:Journal of Symbolic Logic
language:en
Short-container-title:J. symb. log.

Author:

Calvert W.,Fokina E.,Goncharov S. S.,Knight J. F.,Kudinov O.,Morozov A. S.,Puzarenko V.

Abstract

AbstractThis 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 .

Publisher

Cambridge University Press (CUP)

Subject

Logic,Philosophy

Reference21 articles.

1. White W. , Characterizations for computable structures, PhD dissertation, Cornell University, 2000.

2. Millar J. and Sacks G. , Atomic models higher up, preprint.

3. Knight J. F. , A computable structure of Scott rank whose computable infinitary theory is not ℵ0 categorical, in preparation.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Introduction to the Scott Complexity of Countable Structures and a Survey of Recent Results;The Bulletin of Symbolic Logic;2021-11-15

2. AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES;The Journal of Symbolic Logic;2019-04-29

3. There is no classification of the decidably presentable structures;Journal of Mathematical Logic;2018-11-20

4. Highlights of the Rice-Shapiro Theorem in Computable Topology;Lecture Notes in Computer Science;2018

5. THE RICE-SHAPIRO THEOREM IN COMPUTABLE TOPOLOGY;LOG METH COMPUT SCI;2017