scholarly journals Index sets of computable structures

2006 ◽  
Vol 45 (5) ◽  
pp. 306-325 ◽  
Author(s):  
W. Calvert ◽  
V. S. Harizanov ◽  
J. F. Knight ◽  
S. Miller
2007 ◽  
Vol 72 (4) ◽  
pp. 1418-1432 ◽  
Author(s):  
W. Calvert ◽  
E. Fokina ◽  
S. S. Goncharov ◽  
J. F. Knight ◽  
O. Kudinov ◽  
...  

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 .


2007 ◽  
Vol 72 (3) ◽  
pp. 1003-1018 ◽  
Author(s):  
John Chisholm ◽  
Jennifer Chubb ◽  
Valentina S. Harizanov ◽  
Denis R. Hirschfeldt ◽  
Carl G. Jockusch ◽  
...  

AbstractWe study the weak truth-table and truth-table degrees of the images of subsets of computable structures under isomorphisms between computable structures. In particular, we show that there is a low c.e. set that is not weak truth-table reducible to any initial segment of any scattered computable linear ordering. Countable subsets of 2ω and Kolmogorov complexity play a major role in the proof.


2001 ◽  
Vol 40 (5) ◽  
pp. 329-348
Author(s):  
Rod G. Downey ◽  
Michael R. Fellows
Keyword(s):  

2003 ◽  
Vol 49 (1) ◽  
pp. 22-33 ◽  
Author(s):  
Douglas Czenzer ◽  
Jeffrey B. Remmel
Keyword(s):  

2011 ◽  
Vol 77 (4) ◽  
pp. 760-773 ◽  
Author(s):  
Sanjay Jain ◽  
Frank Stephan ◽  
Jason Teutsch
Keyword(s):  

Author(s):  
Elliot Krop ◽  
Sin-Min Lee ◽  
Christopher Raridan
Keyword(s):  

2020 ◽  
Vol 17 ◽  
pp. 1013-1026
Author(s):  
N. A. Bazhenov ◽  
M. I. Marchuk
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document