1. The Person and His Work.- J. Richard Büchi (1924-1984).- The Life of J. Richard Büchi.- The Work of J. Richard Büchi.- The Role of Büchi's Automata in Computer Science.- J. Richard Büchi's Doctoral Students.- Abstracts Published by J. Richard Büchi.- 2. The Publications, with Comments.- Section 1. Boolean Algebras.-  Die Boole'sche Partialordnung und die Paarung von Gefügen.-  Representation of Complete Lattices by Sets.-  Investigation of the Equivalence of the Axiom of Choice and Zorn's Lemma from the Viewpoint of the Hierarchy of Types.- Section 2. Discrete Spaces.-  On the Existence of Totally Heterogeneous Spaces.-  Jordan Circuits of a Graph (with Gary Haggard).-  Skolem Rings and Their Varieties (with T. Michael Owens).- Section 3. Towards a Theory of Definability.-  The Theory of Proportionality as an Abstraction of Group Theory (with Jesse B. Wright).-  Invariants of the Anti-Automorphisms of a Group (with Jesse B. Wright).-  Model Theoretic Approaches to Definability.-  Definability in Normal Theories (with Kenneth J. Danhof).-  Variations on a Theme of Cantor in the Theory of Relational Structures.-  Relatively Categorical and Normal Theories.- Abstract 11. Relatively Categorical and Normal Theories.- Section 4. Automata and Grammars.-  Mathematische Theorie des Verhaltens endlicher Automaten.- Mathematical Theory of the Behavior of Finite Automata (English translation by Sylvia Büchi, Peter Deussen, and Dirk Siefkes).-  Regular Canonical Systems.-  Algebraic Theory of Feedback in Discrete Systems.-  Canonical Systems which Produce Periodic Sets (with William H. Hosken).- Section 5. Automata and Monadic Theories.-  Weak Second-Order Arithmetic and Finite Automata.-  On a Decision Method in Restricted Second Order Arithmetic.-  Transfinite Automata Recursions and Weak Second Order Theory of Ordinals.-  Decision Methods in the Theory of Ordinals.-  Definability in the Monadic Second-Order Theory of Successor (with Lawrence H. Landweber).-  The Complete Extensions of the Monadic Second Order Theory of Countable Ordinals (with Dirk Siefkes).-  Deterministic Automata and the Monadic Theory of Ordinals
J. Richard Biichi is well known for his work in mathematical logic and theoretical computer science. (He himself would have sharply objected to the qualifier "theoretical," because he more or less identified science and theory, using "theory" in a broader sense and "science" in a narrower sense than usual.) We are happy to present here this collection of his papers. I (DS)1 worked with Biichi for many years, on and off, ever since I did my Ph.D. thesis on his Sequential Calculus. His way was to travel locally, not globally: When we met we would try some specific problem, but rarely dis cussed research we had done or might do. After he died in April 1984 I sifted through the manuscripts and notes left behind and was dumbfounded to see what areas he had been in. Essentially I knew about his work in finite au tomata, monadic second-order theories, and computability. But here were at least four layers on his writing desk, and evidently he had been working on them all in parallel. I am sure that many people who knew Biichi would tell an analogous story.
Springer Book Archives