229 | -- | 230 | Samuel R. Buss, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi. Preface |
231 | -- | 237 | Bahareh Afshari, Michael Rathjen. Reverse mathematics and well-ordering principles: A pilot study |
238 | -- | 254 | Laurent Bienvenu, Wolfgang Merkle. Constructive equivalence relations on computable probability measures |
255 | -- | 288 | José Félix Costa, Bruno Loff, Jerzy Mycka. A foundation for real recursive function theory |
289 | -- | 301 | Hristo Ganchev, Ivan N. Soskov. The jump operator on the omega-enumeration degrees |
302 | -- | 309 | Joel David Hamkins, Russell G. Miller. Post s Problem for ordinal register machines: An explicit approach |
310 | -- | 318 | Peter Koepke, Benjamin Seyfferth. Ordinal machines and admissible recursion theory |
319 | -- | 354 | Maria Emilia Maietti. A minimalist two-level foundation for constructive mathematics |
355 | -- | 367 | Alberto Marcone, Antonio Montalbán. On Fraïssé s conjecture for linear orders of finite Hausdorff rank |
368 | -- | 399 | Robert I. Soare. Turing oracle machines, online computing, and three displacements in computability theory |
400 | -- | 418 | Mariya Ivanova Soskova. A non-splitting theorem in the enumeration degrees |