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.
- Matthias Baaz, Richard Zach:
Generalizing Theorems in Real Closed Fields.
- Lev D. Beklemishev:
Iterated Local Reflection Versus Iterated Consistency.
- Alessandro Berarducci, Paola D'Aquino:
Delta0-Complexity of the Relation y = \prodi <= n F(i).
- Wilfried Buchholz:
Proof-Theoretic Analysis of Termination Proofs.
- Samuel R. Buss:
Relating the Bounded Arithmetic and Polynomial Time Hierarchies.
- Fernando Ferreira:
What are the forall Sigmab1-Consequences of T12 and T22?
- Thomas Glaß:
Understanding Uniformity in Feferman's Explicit Mathematics.
- Max I. Kanovich:
Petri Nets, Horn Programs, Linear Logic and Vector Games.
- Alexey P. Kopylov:
On NP-Completeness in Linear Logic.
- Karl-Heinz Niggl:
Towards the Computational Complexity of PRomega-Terms.
- Mati Pentus:
Models for the Lambek Calculus.
Volume 75, Number 3, 27 October 1995
Last update Tue May 21 18:21:23 2013
CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page