1. Recent work at the interface of logic, combinatorics, and computer science

   • John Franco
   • J. Michael Dunn
   • William H. Wheeler

   EditorialNotes Pages: 1 - 15

2. Undecidable statements and random graphs

   • Peter Dolan

   OriginalPaper Pages: 17 - 25

3. The Kreisel length-of-proof problem

   • William M. Farmer

   OriginalPaper Pages: 27 - 55

4. ALOGTIME and a conjecture of S.A. Cook

   • Peter Clote

   OriginalPaper Pages: 57 - 106

5. On induction-free provability

   • Jan Krajíček
   • Gaisi Takeuti

   OriginalPaper Pages: 107 - 125

6. Circuits in bounded arithmetic part I

   • Spyro-Giorgio Mantzivis

   OriginalPaper Pages: 127 - 156

   

7. The relative complexity of resolution and cut-free Gentzen systems

   • Alasdair Urquhart

   OriginalPaper Pages: 157 - 168

8. Davis-Putnam resolution versus unrestricted resolution

   • Andreas Goerdt

   OriginalPaper Pages: 169 - 184

9. Exact satisfiability, a natural extension of set partition, and its average case behavior

   • John W. Rosenthal
   • Ewald Speckenmeyer
   • Rainer Kemp

   OriginalPaper Pages: 185 - 200

10. The expected complexity of analytic tableaux analyses in propositional calculus — II

    • John W. Rosenthal

    OriginalPaper Pages: 201 - 234

11. An average case analysis of a resolution principle algorithm in mechanical theorem proving

    • T. H. Hu
    • C. Y. Tang
    • R. C. T. Lee

    OriginalPaper Pages: 235 - 251

12. The Unique Horn-Satisfiability problem and quadratic Boolean equations

    • M. Minoux

    OriginalPaper Pages: 253 - 266

13. A finite intersection property and the Loeb measurability of ultrafilters on hyperfinite sets

    • R. Lee Panetta

    OriginalPaper Pages: 267 - 270

14. Generalized resolution for 0–1 linear inequalities

    • J. N. Hooker

    OriginalPaper Pages: 271 - 286

15. Turing complexity of Behncke-LeptinC ^*-algebras with a two-point dual

    • Daniele Mundici

    OriginalPaper Pages: 287 - 293