1. Automated reasoning and nonclassical logics: Introduction

   • Michael A. McRobbie

   OriginalPaper Pages: 447 - 451

2. The Ackermann constant theorem: A computer-assisted investigation

   • John K. Slaney

   OriginalPaper Pages: 453 - 474

3. Algorithms for finding matrix models of propositional calculi

   • Paul Pritchard

   OriginalPaper Pages: 475 - 487

4. TABLEAUX: A general theorem prover for modal logics

   • Laurent Catach

   OriginalPaper Pages: 489 - 510

5. A family of goal directed theorem provers based on conjunction and implication: Part 1

   • Dov M. Gabbay
   • Frank Kriwaczek

   OriginalPaper Pages: 511 - 536

6. Computations in fragments of intuitionistic propositional logic

   • Dick De Jongh
   • Lex Hendriks
   • Gerard R. Renardel De Lavalette

   OriginalPaper Pages: 537 - 561

7. Relevant logic programming

   • A. W. Bollen

   OriginalPaper Pages: 563 - 585

8. Condensed detachment is complete for relevance logic: A computer-aided proof

   • Grigori Mints
   • Tanel Tammet

   OriginalPaper Pages: 587 - 596

9. Implementing the ‘Fool's model’ of combinatory logic

   • Robert K. Meyer
   • Martin W. Bunder
   • Lawrence Powers

   OriginalPaper Pages: 597 - 630

10. The problem of choosing the representation, inference rule, and strategy

    • Larry Wos

    Basic Research Problems Pages: 631 - 634

11. Approaching hard non-classical problems

    • Paul B. Thistlewaite
    • Michael A. McRobbie

    Problem Corner Pages: 635 - 637