1. Thread algebra and risk assessment services Jan A. Bergstra, Inge Bethke and Alban Ponse; 2. Covering definable manifolds by open definable subsets Mário J. Edmundo; 3. Isomorphisms and definable relations on computable models Sergei S. Goncharov; 4. Independence for types in algebraically closed valued fields Deirdre Haskell; 5. Simple groups of finite Morley rank Eric Jaligot; 6. Towards a logic of type-free modality and truth Hannes Leitgeb; 7. Structural analysis of Aronszajn trees Justin Tatch Moore; 8. Proof analysis in non-classical logics Sara Negri; 9. Paul Bernays' later philosophy of mathematics Charles Parsons; 10. Proofnets for S5: sequents and circuits for modal logic Greg Restall; 11. Recursion on the partial continuous functionals Helmut Schwichtenberg; 12. A transactional approach to the logic of truth Michael Sheard; 13. On some problems in computable topology Dieter Spreen; 14. Monotone inductive definitions and consistency of New Foundations Sergei Tupailo.