Stephen L. Bloom – författare

Cal Elgot was a very serious and thoughtful researcher, who with great determi­ nation attempted to find basic explanations for certain mathematical phenomena­ as the selection of papers in this volume well illustrate. His approach was, for the most part, rather finitist and constructivist, and he was inevitably drawn to studies of the process of computation. It seems to me that his early work on decision problems relating automata and logic, starting with his thesis under Roger Lyndon and continuing with joint work with Biichi, Wright, Copi, Rutledge, Mezei, and then later with Rabin, set the stage for his attack on the theory of computation through the abstract treatment of the notion of a machine. This is also apparent in his joint work with A. Robinson reproduced here and in his joint papers with John Shepherdson. Of course in the light of subsequent work on decision problems by Biichi, Rabin, Shelah, and many, many others, the subject has been placed on a completely different plane from what it was when Elgot left the area. But I feel that his papers, results-and style-were very definitely influential at the time and may well have altered the course of the investigation of these problems. As Sammy Eilenberg explains, the next big influence on Elgot''s thinking was category theory, which gave him a way of expressing his ideas in a sharply algebraic manner. The joint book with Eilenberg is one illustration of this influence.

Cal Elgot was a very serious and thoughtful researcher, who with great determi­ nation attempted to find basic explanations for certain mathematical phenomena­ as the selection of papers in this volume well illustrate. His approach was, for the most part, rather finitist and constructivist, and he was inevitably drawn to studies of the process of computation. It seems to me that his early work on decision problems relating automata and logic, starting with his thesis under Roger Lyndon and continuing with joint work with Biichi, Wright, Copi, Rutledge, Mezei, and then later with Rabin, set the stage for his attack on the theory of computation through the abstract treatment of the notion of a machine. This is also apparent in his joint work with A. Robinson reproduced here and in his joint papers with John Shepherdson. Of course in the light of subsequent work on decision problems by Biichi, Rabin, Shelah, and many, many others, the subject has been placed on a completely different plane from what it was when Elgot left the area. But I feel that his papers, results-and style-were very definitely influential at the time and may well have altered the course of the investigation of these problems. As Sammy Eilenberg explains, the next big influence on Elgot's thinking was category theory, which gave him a way of expressing his ideas in a sharply algebraic manner. The joint book with Eilenberg is one illustration of this influence.

This monograph contains the results of our joint research over the last ten years on the logic of the fixed point operation. The intended au­ dience consists of graduate students and research scientists interested in mathematical treatments of semantics. We assume the reader has a good mathematical background, although we provide some prelimi­ nary facts in Chapter 1. Written both for graduate students and research scientists in theoret­ ical computer science and mathematics, the book provides a detailed investigation of the properties of the fixed point or iteration operation. Iteration plays a fundamental role in the theory of computation: for example, in the theory of automata, in formal language theory, in the study of formal power series, in the semantics of flowchart algorithms and programming languages, and in circular data type definitions. It is shown that in all structures that have been used as semantical models, the equational properties of the fixed point operation are cap­ tured by the axioms describing iteration theories. These structures include ordered algebras, partial functions, relations, finitary and in­ finitary regular languages, trees, synchronization trees, 2-categories, and others.