1. Preface

   • Bengt Nordström

   Programming Logic Pages: 2 - 4

2. On list primitive recursion and the complexity of computinginf

   • Loïc Colson

   Programming Logic Pages: 5 - 9

3. The paradox of trees in type theory

   • Thierry Coquand

   Programming Logic Pages: 10 - 14

4. Theo: An interactive proof development system

   • Joëlle Despeyroux

   Programming Logic Pages: 15 - 29

5. Partial inductive definitions as type-systems for λ-terms

   • Daniel Fredholm
   • Svetozar Serafimovski

   Programming Logic Pages: 30 - 44

6. On systems of definitions, induction and recursion

   • Lars Hallnäs

   Programming Logic Pages: 45 - 63

7. Complexity of subclasses of the intuitionistic propositional calculus

   • G. Mints

   Programming Logic Pages: 64 - 69

8. Remarks on Martin-Löf's partial type theory

   • Erik Palmgren
   • Viggo Stoltenberg-Hansen

   Programming Logic Pages: 70 - 83

9. On specifications, subset types and interpretation of proposition in type theory

   • Anne Salvesen

   Programming Logic Pages: 84 - 101

10. Local error estimation for singly-implicit formulas by two-step Runge-Kutta methods

    • A. Bellen
    • Z. Jackiewicz
    • M. Zennaro

    Part II Numerical Mathematics Pages: 104 - 117

11. Generalized Padé approximations to the exponential function

    • J. C. Butcher
    • F. H. Chipman

    Part II Numerical Mathematics Pages: 118 - 130

12. Order conditions for canonical Runge-Kutta-Nyström methods

    • M. P. Calvo
    • J. M. Sanz-Serna

    Part II Numerical Mathematics Pages: 131 - 142

13. Jacobi matrices for sums of weight functions

    • Sylvan Elhay
    • Gene H. Golub
    • Jaroslav Kautsky

    Part II Numerical Mathematics Pages: 143 - 166

14. A family of centered forms for a polynomial

    • Qun Lin
    • J. G. Rokne

    Part II Numerical Mathematics Pages: 167 - 176