This volume provides an account of the current state of the theory of combinatory spaces and discusses various applications. Here the term "combinatory space" can be regarded as a system for functional programming and bears no close connection with combinatory logic. The main chapter is divided into three chapters. Chapter 1 deals with computational structures and computability; Chapter 2 considers combinatory spaces; and Chapter 3 embraces computability in iterative combinatory spaces. A number of appendices treats a survey of examples of combinatory spaces. All sections of the chapters contain exercises together with hints for solution where appropriate. For the reading of some parts of the book a knowledge of mathematical logic and recursive function theory would be desirable. The text is mainly aimed at researchers and specialists of mathematical logic and its applications, as well as theoretical computer scientists.

One service mathematics bas rendered the 'Bt moi, .... si j'avait su comment en revenir, je human race. It bas put common sense back n'y semis point aU6.' where it belongs, on the topmost shelf next to Jules Verne the dusty canister labelled 'discarded nonsense'. BrieT.Bell The series is divergent; therefore we may be able to do something with it. O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and nonlineari ties abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sci ences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One ser vice topology has rendered mathematical physics .. .'; 'One service logic has rendered computer science .. .'; 'One service category theory has rendered mathematics .. .'. All arguably true. And all statements obtainable this way form part of the raison d' 8tre of this series."

The Summer School and Conference on Mathematical Logic and its Applications, September 24 - October 4, 1986, Druzhba, Bulgaria, was honourably dedicated to the 80-th anniversary of Kurt Godel (1906 - 1978), one of the greatest scientists of this (and not only of this) century. The main topics of the Meeting were: Logic and the Foundation of Mathematics; Logic and Computer Science; Logic, Philosophy, and the Study of Language; Kurt Godel's life and deed. The scientific program comprised 5 kinds of activities, namely: a) a Godel Session with 3 invited lecturers b) a Summer School with 17 invited lecturers c) a Conference with 13 contributed talks d) Seminar talks (one invited and 12 with no preliminary selection) e) three discussions The present volume reflects an essential part of this program, namely 14 of the invited lectures and all of the contributed talks. Not presented in the volltme remai ned si x of the i nvi ted lecturers who di d not submi t texts: Yu. Ershov - The Language of : -expressions and its Semantics; S. Goncharov - Mathematical Foundations of Semantic Programming; Y. Moschovakis - Foundations of the Theory of Algorithms; N. Nagornyj - Is Realizability of Propositional Formulae a GBdelean Property; N. Shanin - Some Approaches to Finitization of Mathematical Analysis; V. Uspensky - Algorithms and Randomness - joint with A. N.