| 1 | -- | 15 | John V. Franco, J. Michael Dunn, William H. Wheeler. Recent Work at the Interface of Logic, Combinatorics and Computer Science |
| 17 | -- | 25 | Peter Dolan. Undecidable Statements and Random Graphs |
| 27 | -- | 55 | William M. Farmer. The Kreisel Length-of-Proof Problem |
| 57 | -- | 106 | Peter Clote. ALOGTIME and a Conjecture of S. A. Cook |
| 107 | -- | 125 | Jan Krajícek, Gaisi Takeuti. On Induction-Free Provability |
| 127 | -- | 156 | Spyro-Giorgio Mantzivis. Circuits in Bounded Arithmetic, Part I |
| 157 | -- | 168 | Alasdair Urquhart. The Relative Complexity of Resolution and Cut-Free Gentzen Systems |
| 169 | -- | 184 | Andreas Goerdt. Davis-Putnam Resolution versus Unrestricted Resolution |
| 185 | -- | 200 | John W. Rosenthal, Ewald Speckenmeyer, Rainer Kemp. Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case Behavior |
| 201 | -- | 234 | John W. Rosenthal. The Expected Complexity of Analytic Tableaux Analyses in Propositional Calculus - II |
| 235 | -- | 251 | T. H. Hu, Chuan Yi Tang, Richard C. T. Lee. An Average Case Analysis of a Resolution Principle Algorithm in Mechanical Theorem Proving |
| 253 | -- | 266 | Michel Minoux. The Unique Horn-Satisfiability Problem and Quadratic Boolean Equations |
| 267 | -- | 270 | R. Lee Panetta. A Finite Intersection Property and the Loeb Measurability of Ultrafilters on Hyperfinite Sets |
| 271 | -- | 286 | John N. Hooker. Generalized Resolution for 0-1 Linear Inequalities |
| 287 | -- | 293 | Daniele Mundici. Turing Complexity of Behncke-Leptin C:::*:::-algebras with a Two-Point Dual |