1. Subsystems of Peano Arithmetic: some results and problems

2. Current trends in Model Theory and Hilbert's tenth problem

3. Laws in Finite Model Theory: an overview

4. Nonstandard methods in many-valued logics

5. Cut elimination in the simply lambda calculus

6. Church-Rosser theorem for conjunctive type systems

7. Formal number theory and subrecursive degree structures

8. Reverse Recursion Theory: Some results

9. Idempotence of classical logics and the logic of multisets

10. Ανάστροφα μαθηματικά: επισκόπηση

11. Computable and polynomially time computable real and p-adic numbers

12. Locale theoretic methods in Logics without contraction

13. On End extensions of models of fragments of PA

14. A language of transformation

15. Arity hierarchies for fixed-point logic

16. Expressiveness of recursive database queries

17. Program specification and verification

18. Non-collapsing assumptions about complexity classes needed for proving non-approximability results

19. The role of nonmonotonic representations in requirements engineering

20. Refining logical characterization of advice complexity classes