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

- Matthias Baaz, Richard Zach:
Generalizing Theorems in Real Closed Fields.
3-23

- Lev D. Beklemishev:
Iterated Local Reflection Versus Iterated Consistency.
25-48

- Alessandro Berarducci, Paola D'Aquino:
Delta0-Complexity of the Relation y = \prodi <= n F(i).
49-56

- Wilfried Buchholz:
Proof-Theoretic Analysis of Termination Proofs.
57-65

- Samuel R. Buss:
Relating the Bounded Arithmetic and Polynomial Time Hierarchies.
67-77

- Fernando Ferreira:
What are the forall Sigmab1-Consequences of T12 and T22?
79-88

- Thomas Glaß:
Understanding Uniformity in Feferman's Explicit Mathematics.
89-106

- Max I. Kanovich:
Petri Nets, Horn Programs, Linear Logic and Vector Games.
107-135

- Alexey P. Kopylov:
On NP-Completeness in Linear Logic.
137-152

- Karl-Heinz Niggl:
Towards the Computational Complexity of PRomega-Terms.
153-178

- Mati Pentus:
Models for the Lambek Calculus.
179-213

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