1. S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) (1996). Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press.
    The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. R. G. Downey & T. A. Slaman (1989). Completely Mitotic R.E. Degrees. Annals of Pure and Applied Logic 41 (2):119-152.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  3. T. A. Slaman (1986). ∑1 Definitions with Parameters. Journal of Symbolic Logic 51 (2):453 - 461.
    Let p be a set. A function φ is uniformly σ 1 (p) in every admissible set if there is a σ 1 formula φ in the parameter p so that φ defines φ in every σ 1 -admissible set which includes p. A theorem of Van de Wiele states that if φ is a total function from sets to sets then φ is uniformly σ 1R in every admissible set if anly only if it is E-recursive. A function is (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation