1. Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem

   • Neil Thapen

   OriginalPaper 02 June 2011 Pages: 665 - 680

2. Limit computable integer parts

   • Paola D’Aquino
   • Julia Knight
   • Karen Lange

   OriginalPaper 18 June 2011 Pages: 681 - 695

3. Model theory of the inaccessibility scheme

   • Shahram Mohsenipour

   OriginalPaper 04 June 2011 Pages: 697 - 706

4. Level by level inequivalence beyond measurability

   • Arthur W. Apter

   OriginalPaper 23 June 2011 Pages: 707 - 712

5. Axiomatizability by \({{\forall}{\exists}!}\)-sentences

   • Miguel Campercholi
   • Diego Vaggione

   OriginalPaper 30 June 2011 Pages: 713 - 725

6. Proof complexity of propositional default logic

   • Olaf Beyersdorff
   • Arne Meier
   • Heribert Vollmer

   OriginalPaper 03 July 2011 Pages: 727 - 742

7. One-basedness and groups of the form G/G ⁰⁰

   • Davide Penazzi

   OriginalPaper 16 July 2011 Pages: 743 - 758

8. Consistency strength of higher chang’s conjecture, without CH

   • Sean D. Cox

   OriginalPaper 10 July 2011 Pages: 759 - 775

9. On the conservativity of the axiom of choice over set theory

   • Timothy J. Carlson

   OriginalPaper 09 August 2011 Pages: 777 - 790

10. MAD families of projections on l ² and real-valued functions on ω

    • Tristan Bice

    OriginalPaper 04 September 2011 Pages: 791 - 801