Volume 41, Number 1, January 2002
: A term rewriting characterization of the functions computable in polynomial space.
: Strong normalization of a symmetric lambda calculus for second-order classical logic.
Volume 41, Number 2, February 2002
: On the algebraic structure of linear, relevance, and fuzzy logics.
: Epsilon substitution method for theories of jump hierarchies.
: Polytime, combinatory logic and positive safe induction.
Volume 41, Number 3, April 2002
: On the existence of large subsets of [lambda]kappa which contain no unbounded non-stationary subsets.
: The algebraic structure of the isomorphic types of tally, polynomial time computable sets.
: A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets.
Alexej P. Pynko
: Extensions of Halkowska-Zajac's three-valued paraconsistent logic.
Volume 41, Number 4, April 2002
Volume 41, Number 5, July 2002
Volume 41, Number 6, August 2002
Volume 41, Number 7, October 2002
Volume 41, Number 8, November 2002
Arthur W. Apter
: Aspects of strong compactness, measurability, and indestructibility.
: Representation theorems for transfinite computability and definability.
: Continuity, proof systems and the theory of transfinite computations.
: A normalizing system of natural deduction for intuitionistic linear logic.