1. Conjectures and questions from Gerald Sacks's Degrees of Unsolvability

   • Richard A. Shore

   Pages: 233 - 253

2. Definability in the enumeration degrees

   • Theodore A. Slaman
   • W. Hugh Woodin

   Pages: 255 - 267

3. Closing the gap between the continuous functionals and recursion in \(^3E\)

   • D. Normann

   Pages: 269 - 287

4. Relativized projecta and \(\beta\)-r.e. sets

   • Colin G. Bailey

   Pages: 289 - 296

5. Iterated trees of strategies and priority arguments

   • Steffen Lempp
   • Manuel Lerman

   Pages: 297 - 312

6. Rank, join, and Cantor singletons

   • Jim Owings

   Pages: 313 - 320

7. On the parameterized complexity of short computation and factorization

   • Liming Cai
   • Jianer Chen
   • Michael R. Fellows

   Pages: 321 - 337