Switch to: References

Add citations

You must login to add citations.
  1. Totally ω-computably enumerable degrees and bounding critical triples.Rod Downey, Noam Greenberg & Rebecca Weber - 2007 - Journal of Mathematical Logic 7 (2):145-171.
    We characterize the class of c.e. degrees that bound a critical triple as those degrees that compute a function that has no ω-c.e. approximation.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • $\Pi _{1}^{0}$ Classes and Strong Degree Spectra of Relations.John Chisholm, Jennifer Chubb, Valentina S. Harizanov, Denis R. Hirschfeldt, Carl G. Jockusch, Timothy McNicholl & Sarah Pingrey - 2007 - Journal of Symbolic Logic 72 (3):1003 - 1018.
    We 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 $\Pi _{1}^{0}$ subsets of 2ω and Kolmogorov complexity play a major role in the proof.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Low level nondefinability results: Domination and recursive enumeration.Mingzhong Cai & Richard A. Shore - 2013 - Journal of Symbolic Logic 78 (3):1005-1024.
    Download  
     
    Export citation  
     
    Bookmark