4 found
Order:
  1.  29
    Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion.C. G. Jockusch, M. Lerman, R. I. Soare & R. M. Solovay - 1989 - Journal of Symbolic Logic 54 (4):1288-1323.
  2.  85
    Π01-Classes and Rado's Selection Principle.C. G. Jockusch, A. Lewis & J. B. Remmel - 1991 - Journal of Symbolic Logic 56 (2):684 - 693.
  3.  3
    $\pi^0_1$-Classes And Rado's Selection Principle.C. G. Jockusch, A. Lewis & J. B. Remmel - 1991 - Journal of Symbolic Logic 56 (2):684-693.
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  4.  31
    Decidability and Undecidability of Theories with a Predicate for the Primes.P. T. Bateman, C. G. Jockusch & A. R. Woods - 1993 - Journal of Symbolic Logic 58 (2):672-687.
    It is shown, assuming the linear case of Schinzel's Hypothesis, that the first-order theory of the structure $\langle \omega; +, P\rangle$ , where P is the set of primes, is undecidable and, in fact, that multiplication of natural numbers is first-order definable in this structure. In the other direction, it is shown, from the same hypothesis, that the monadic second-order theory of $\langle\omega; S, P\rangle$ is decidable, where S is the successor function. The latter result is proved using a general (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation