Author:
Chisholm John,Chubb Jennifer,Harizanov Valentina S.,Hirschfeldt Denis R.,Jockusch Carl G.,McNicholl Timothy,Pingrey Sarah
Abstract
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.
Publisher
Cambridge University Press (CUP)
Reference37 articles.
1. classes and degrees of theories;Jockusch;Transactions of the American Mathematical Society,1972
2. Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures;Hirschfeldt;Notre Dame Journal of Formal Logic,2002
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES;The Bulletin of Symbolic Logic;2018-03
2. Weak Truth Table Degrees of Structures;Notre Dame Journal of Formal Logic;2015-01-01
3. Algorithmic Randomness and Complexity;Theory and Applications of Computability;2010