Volume 44, Number 1, January 2005
: On the predicate logics of continuous t-norm BL-algebras.
: The problem of the formalization of constructive topology.
Volume 44, Number 2, February 2005
Volume 44, Number 3, April 2005
: An ordinal analysis of parameter free Pi12-comprehension.
: Models of set theory with definable ordinals.
Volume 44, Number 4, May 2005
: Epsilon substitution for transfinite induction.
: A proof-theoretical investigation of global intuitionistic (fuzzy) logic.
R. E. Hodel
: Restricted versions of the Tukey-Teichmüller theorem that are equivalent to the Boolean prime ideal theorem.
: Categorical abstract algebraic logic categorical algebraization of first-order logic without terms.
Volume 44, Number 5, July 2005
: On the relationship between fixed points and iteration in admissible set theory without foundation.
: Saturation, Suslin trees and meager sets.
: Notes on subtlety and ineffability in Pkappalambda.
Volume 44, Number 6, August 2005
: Hardness assumptions in the foundations of theoretical computer science.
: The diamond principle for the uniformity of the meager ideal implies the existence of a destructible gap.
: Separations of first and second order theories in bounded arithmetic.
: Primitive recursive analogues of regular cardinals based on ordinal representation systems for KPi and KPM.
: Bounded truth table does not reduce the one-query tautologies to a random oracle.
: On arithmetic in the Cantor- Lukasiewicz fuzzy set theory.
Volume 44, Number 7, October 2005
Volume 44, Number 8, November 2005
: A Characterization of Generalized Príkrý Sequences.
: Diagonal fixed points in algebraic recursion theory.
: Epsilon substitution method for [Pi01, Pi01]-FIX.
: Hypersimplicity and semicomputability in the weak truth table degrees.