Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem Neil Thapen OriginalPaper 02 June 2011 Pages: 665 - 680
Limit computable integer parts Paola D’AquinoJulia KnightKaren Lange OriginalPaper 18 June 2011 Pages: 681 - 695
Model theory of the inaccessibility scheme Shahram Mohsenipour OriginalPaper 04 June 2011 Pages: 697 - 706
Level by level inequivalence beyond measurability Arthur W. Apter OriginalPaper 23 June 2011 Pages: 707 - 712
Axiomatizability by \({{\forall}{\exists}!}\)-sentences Miguel CampercholiDiego Vaggione OriginalPaper 30 June 2011 Pages: 713 - 725
Proof complexity of propositional default logic Olaf BeyersdorffArne MeierHeribert Vollmer OriginalPaper 03 July 2011 Pages: 727 - 742
One-basedness and groups of the form G/G 00 Davide Penazzi OriginalPaper 16 July 2011 Pages: 743 - 758
Consistency strength of higher chang’s conjecture, without CH Sean D. Cox OriginalPaper 10 July 2011 Pages: 759 - 775
On the conservativity of the axiom of choice over set theory Timothy J. Carlson OriginalPaper 09 August 2011 Pages: 777 - 790
MAD families of projections on l 2 and real-valued functions on ω Tristan Bice OriginalPaper 04 September 2011 Pages: 791 - 801