1. Predicate calculus of arbitrarily high finite order

   • M. W. Bunder

   OriginalPaper Pages: 1 - 10

2. Bases of ZF⁰-models

   • Michael v. Rimscha

   OriginalPaper Pages: 11 - 19

3. λ-definable functionals andβη conversion

   • R. Statman

   OriginalPaper Pages: 21 - 26

4. A lower bound for the complexity of Craig's interpolants in sentential logic

   • Daniele Mundici

   OriginalPaper Pages: 27 - 36

5. Natural limitations of decision procedures for arithmetic with bounded quantifiers

   • Daniele Mundici

   OriginalPaper Pages: 37 - 54

6. A note on a proof of Shepherdson

   • T. B. Flannagan

   OriginalPaper Pages: 55 - 60

7. Variants of Robinson's essentially undecidable theoryR

   • James P. Jones
   • John C. Shepherdson

   OriginalPaper Pages: 61 - 64

8. A well-ordering proof for Feferman's theoryT ₀

   • Gerhard Jäger

   OriginalPaper Pages: 65 - 77

9. R.E. degrees of continuous functionals

   • Dag Normann

   OriginalPaper Pages: 79 - 98

10. A one axiom set theory based on higher order predicate calculus

    • M. W. Bunder

    OriginalPaper Pages: 99 - 107

11. Set theory in predicate calculus with equality

    • M. W. Bunder

    OriginalPaper Pages: 109 - 113

12. Definable Ramsey and definable Erdös ordinals

    • Evangelos Kranakis

    OriginalPaper Pages: 115 - 128

13. Die Unentscheidbarkeit der einstelligen unendlichwertigen Prädikatenlogik

    • Matthias Ragaz

    OriginalPaper Pages: 129 - 139

14. Die Nichtaxiomatisierbarkeit der unendlichwertigen Mengenlehre

    • Matthias Ragaz

    OriginalPaper Pages: 141 - 146

15. A note on tight stable theorie

    • Anand Pillay

    OriginalPaper Pages: 147 - 152

16. On a weakening of Markov's Principle

    • A. Ščedrov
    • R. Vesley

    OriginalPaper Pages: 153 - 160

17. A classification of the one-argument primitive recursive functions

    • Jovan Naumović

    OriginalPaper Pages: 161 - 174

18. A classification of an iterative hierarchy

    • Hans Kleine Büning

    OriginalPaper Pages: 175 - 186