Jan Krajícek Hardness assumptions in the foundations of theoretical computer science. [Citation Graph (0, 0)][DBLP] Arch. Math. Log., 2005, v:44, n:6, pp:667-675 [Journal]

Teruyuki Yorioka The diamond principle for the uniformity of the meager ideal implies the existence of a destructible gap. [Citation Graph (0, 0)][DBLP] Arch. Math. Log., 2005, v:44, n:6, pp:677-683 [Journal]

Masahiro Yasumoto Separations of first and second order theories in bounded arithmetic. [Citation Graph (0, 0)][DBLP] Arch. Math. Log., 2005, v:44, n:6, pp:685-688 [Journal]

Osamu Takaki Primitive recursive analogues of regular cardinals based on ordinal representation systems for KPi and KPM. [Citation Graph (0, 0)][DBLP] Arch. Math. Log., 2005, v:44, n:6, pp:689-709 [Journal]

Toshio Suzuki Bounded truth table does not reduce the one-query tautologies to a random oracle. [Citation Graph (0, 0)][DBLP] Arch. Math. Log., 2005, v:44, n:6, pp:751-762 [Journal]

Petr Hájek On arithmetic in the Cantor- Lukasiewicz fuzzy set theory. [Citation Graph (0, 0)][DBLP] Arch. Math. Log., 2005, v:44, n:6, pp:763-782 [Journal]