Switch to: Citations

Add references

You must login to add references.
  1. An Undecidable Linear Order That Is $n$-Decidable for All $n$.John Chisholm & Michael Moses - 1998 - Notre Dame Journal of Formal Logic 39 (4):519-526.
    A linear order is -decidable if its universe is and the relations defined by formulas are uniformly computable. This means that there is a computable procedure which, when applied to a formula and a sequence of elements of the linear order, will determine whether or not is true in the structure. A linear order is decidable if the relations defined by all formulas are uniformly computable. These definitions suggest two questions. Are there, for each , -decidable linear orders that are (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Possible degrees in recursive copies II.C. J. Ash & J. F. Knight - 1997 - Annals of Pure and Applied Logic 87 (2):151-165.
    We extend results of Harizanov and Barker. For a relation R on a recursive structure /oA, we give conditions guaranteeing that the image of R in a recursive copy of /oA can be made to have arbitrary ∑α0 degree over Δα0. We give stronger conditions under which the image of R can be made ∑α0 degree as well. The degrees over Δα0 can be replaced by certain more general classes. We also generalize the Friedberg-Muchnik Theorem, giving conditions on a pair (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • Generic copies of countable structures.Chris Ash, Julia Knight, Mark Manasse & Theodore Slaman - 1989 - Annals of Pure and Applied Logic 42 (3):195-205.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   41 citations  
  • Computable Structures and the Hyperarithmetical Hierarchy.Valentina Harizanov - 2001 - Bulletin of Symbolic Logic 7 (3):383-385.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   39 citations