| 667 | -- | 0 | Alexandra Soskova, S. Barry Cooper, Andrea Sorbi. Computability at Logic Colloquium 2009 |
| 669 | -- | 677 | Marat M. Arslanov. Model-theoretic properties of the n-c.e. degrees |
| 679 | -- | 691 | George Barmpalias. Compactness arguments with effectively closed sets for the study of relative randomness |
| 693 | -- | 699 | George Barmpalias, André Nies. Low upper bounds in the Turing degrees revisited |
| 701 | -- | 715 | Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle. Separations of non-monotonic randomness notions |
| 717 | -- | 735 | Angel V. Ditchev. Least enumerations of partial structures |
| 737 | -- | 743 | Marat Kh. Faizrahmanov, Iskander Sh. Kalimullin. Turing and enumeration jumps in the Ershov hierarchy |
| 745 | -- | 754 | Andrey N. Frolov. Low linear orderings |
| 755 | -- | 777 | Andrey Frolov, Iskander Sh. Kalimullin, Valentina S. Harizanov, Oleg V. Kudinov, Russell Miller. n degrees |
| 779 | -- | 792 | Hristo Ganchev, Mariya Ivanova Soskova. 2 enumeration degrees |
| 793 | -- | 805 | Alexander Gavryushkin. On constructive models of theories with linear Rudin-Keisler ordering |
| 807 | -- | 829 | Charles M. Harris. Non-cuppable enumeration degrees via finite injury |
| 831 | -- | 843 | Iskander Sh. Kalimullin. Algorithmic reducibilities of algebraic structures |
| 845 | -- | 855 | Andrew E. M. Lewis. Properties of the jump classes |
| 857 | -- | 876 | Antonio Montalbán. Counting the back-and-forth types |
| 877 | -- | 897 | Anthony Morphett. Prompt enumerations and relative randomness |
| 899 | -- | 925 | Dimiter Skordev, Andreas Weiermann, Ivan Georgiev. 2-computable real numbers |
| 927 | -- | 952 | Mariya Ivanova Soskova, Ivan N. Soskov. ω-enumeration degrees |