1. Partially definable forcing and bounded arithmetic

   • Albert Atserias
   • Moritz Müller

   OriginalPaper 29 August 2014 Pages: 1 - 33

2. Isomorphic and strongly connected components

   • Miloš S. Kurilić

   OriginalPaper 04 September 2014 Pages: 35 - 48

3. Reverse mathematics and marriage problems with unique solutions

   • Jeffry L. Hirst
   • Noah A. Hughes

   OriginalPaper 02 September 2014 Pages: 49 - 57

4. Friedberg numberings in the Ershov hierarchy

   • Serikzhan A. Badaev
   • Mustafa Manat
   • Andrea Sorbi

   OriginalPaper 13 September 2014 Pages: 59 - 73

5. Full and hat inductive definitions are equivalent in NBG

   • Kentaro Sato

   OriginalPaper 01 November 2014 Pages: 75 - 112

6. Arithmetical algorithms for elementary patterns

   • Samuel A. Alexander

   OriginalPaper 14 October 2014 Pages: 113 - 132

7. A forcing notion related to Hindman’s theorem

   • Luz María García-Ávila

   OriginalPaper 15 October 2014 Pages: 133 - 159

8. Adding a club with finite conditions, Part II

   • John Krueger

   OriginalPaper 11 October 2014 Pages: 161 - 172

9. Strong partition cardinals and determinacy in \({K(\mathbb{R})}\)

   • Daniel W. Cunningham

   OriginalPaper 11 October 2014 Pages: 173 - 192

10. Well-partial-orderings and the big Veblen number

    • Jeroen Van der Meeren
    • Michael Rathjen
    • Andreas Weiermann

    OriginalPaper 13 November 2014 Pages: 193 - 230

11. Between Polish and completely Baire

    • Andrea Medini
    • Lyubomyr Zdomskyy

    OriginalPaper 30 October 2014 Pages: 231 - 245

12. Forking geometry on theories with an independent predicate

    • Juan Felipe Carmona

    OriginalPaper 04 November 2014 Pages: 247 - 255