## Volume 75,
Numbers 1-2,
12 September 1995

Special Issue Invited papers presented at the "Conference on Proof Theory,
Provability Logic,
and Computation" 20-24 March 1994,
Berne,
Switzerland
- Sergei N. Artëmov, George Boolos, Erwin Engeler, Solomon Feferman, Gerhard Jäger, Albert Visser:
Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994.
1 BibTeX
- Matthias Baaz, Richard Zach:
Generalizing Theorems in Real Closed Fields.
3-23 BibTeX
- Lev D. Beklemishev:
Iterated Local Reflection Versus Iterated Consistency.
25-48 BibTeX
- Alessandro Berarducci, Paola D'Aquino:
Delta
_{0}-Complexity of the Relation y = \prod_{i <= n} F(i).
49-56 BibTeX
- Wilfried Buchholz:
Proof-Theoretic Analysis of Termination Proofs.
57-65 BibTeX
- Samuel R. Buss:
Relating the Bounded Arithmetic and Polynomial Time Hierarchies.
67-77 BibTeX
- Fernando Ferreira:
What are the forall Sigma
^{b}_{1}-Consequences of T^{1}_{2} and T^{2}_{2}?
79-88 BibTeX
- Thomas Glaß:
Understanding Uniformity in Feferman's Explicit Mathematics.
89-106 BibTeX
- Max I. Kanovich:
Petri Nets, Horn Programs, Linear Logic and Vector Games.
107-135 BibTeX
- Alexey P. Kopylov:
On NP-Completeness in Linear Logic.
137-152 BibTeX
- Karl-Heinz Niggl:
Towards the Computational Complexity of PR
^{omega}-Terms.
153-178 BibTeX
- Mati Pentus:
Models for the Lambek Calculus.
179-213 BibTeX

## Volume 75,
Number 3,
27 October 1995

Copyright © Sat May 16 23:50:43 2009
by Michael Ley (ley@uni-trier.de)