Hardness assumptions in the foundations of theoretical computer science Jan Krajíček OriginalPaper 03 May 2005 Pages: 667 - 675
The diamond principle for the uniformity of the meager ideal implies the existence of a destructible gap Teruyuki Yorioka OriginalPaper 06 July 2005 Pages: 677 - 683
Separations of first and second order theories in bounded arithmetic Masahiro Yasumoto OriginalPaper 06 July 2005 Pages: 685 - 688
Primitive recursive analogues of regular cardinals based on ordinal representation systems for KPi and KPM Osamu Takaki OriginalPaper 06 July 2005 Pages: 689 - 709
Quantified propositional calculus and a second-order theory for NC1 Stephen CookTsuyoshi Morioka OriginalPaper 18 July 2005 Pages: 711 - 749
Bounded truth table does not reduce the one-query tautologies to a random oracle Toshio Suzuki OriginalPaper 06 July 2005 Pages: 751 - 762
On arithmetic in the Cantor- Łukasiewicz fuzzy set theory Petr Hájek OriginalPaper 06 June 2005 Pages: 763 - 782
Propositional logic of continuous transformations in Cantor space Grigori MintsTing Zhang OriginalPaper 06 June 2005 Pages: 783 - 799