Volume 41, Number 1, January 2002
Isabel Oitavem:
A term rewriting characterization of the functions computable in polynomial space. 35-47
Yoriyuki Yamagata:
Strong normalization of a symmetric lambda calculus for second-order classical logic. 91-99
Volume 41, Number 2, February 2002
Francesco Paoli:
On the algebraic structure of linear, relevance, and fuzzy logics. 107-121
Toshiyasu Arai:
Epsilon substitution method for theories of jump hierarchies. 123-153
Andrea Cantini:
Polytime, combinatory logic and positive safe induction. 169-189
Volume 41, Number 3, April 2002
Saharon Shelah:
On the existence of large subsets of [lambda]kappa which contain no unbounded non-stationary subsets. 207-213
Yongge Wang:
The algebraic structure of the isomorphic types of tally, polynomial time computable sets. 215-244
Arnold Beckmann:
A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets. 251-257
Alexej P. Pynko:
Extensions of Halkowska-Zajac's three-valued paraconsistent logic. 299-307
Volume 41, Number 4, April 2002
Volume 41, Number 5, July 2002
C. Luppi:
On the Beth properties of some intuitionistic modal logics. 443-454
Mitio Takano:
Strong completeness of lattice-valued logic. 497-505
Volume 41, Number 6, August 2002
Volume 41, Number 7, October 2002
Silvio Valentini:
On the formal points of the formal topology of the binary tree. 603-618
Volume 41, Number 8, November 2002
Arthur W. Apter:
Aspects of strong compactness, measurability, and indestructibility. 705-719
Dag Normann:
Representation theorems for transfinite computability and definability. 721-741
Dag Normann:
Continuity, proof systems and the theory of transfinite computations. 765-788
Sara Negri:
A normalizing system of natural deduction for intuitionistic linear logic. 789-810