1. Indestructibility of Vopěnka’s Principle

   • Andrew D. Brooke-Taylor

   OriginalPaper 28 January 2011 Pages: 515 - 529

2. Base-free formulas in the lattice-theoretic study of compacta

   • Paul Bankston

   Original Article 24 February 2011 Pages: 531 - 542

3. The maximal linear extension theorem in second order arithmetic

   • Alberto Marcone
   • Richard A. Shore

   Original Article 20 March 2011 Pages: 543 - 564

4. Totally non-proper ordinals beyond L(V _λ+1)

   • Vincenzo Dimonte

   Original Article 24 March 2011 Pages: 565 - 584

5. A remark on the tree property in a choiceless context

   • Arthur W. Apter

   Original Article 01 April 2011 Pages: 585 - 590

6. Supercompact extender based Prikry forcing

   • Carmi Merimovich

   Original Article 10 April 2011 Pages: 591 - 602

7. Definably complete structures are not pseudo-enumerable

   • Antongiulio Fornasiero

   Original Article 26 March 2011 Pages: 603 - 615

8. On nested simple recursion

   • Ján Komara

   Original Paper 30 April 2011 Pages: 617 - 624

9. Strict core fuzzy logics and quasi-witnessed models

   • Marco Cerami
   • Francesc Esteva

   Original Article 01 May 2011 Pages: 625 - 641

10. Admissible closures of polynomial time computable arithmetic

    • Dieter Probst
    • Thomas Strahm

    Original Article 04 May 2011 Pages: 643 - 660

11. σ-Homogeneity of Borel sets

    • Alexey Ostrovsky

    Original Article 01 May 2011 Pages: 661 - 664