© 1993

Logical Methods

In Honor of Anil Nerode’s Sixtieth Birthday

  • John N. Crossley
  • Jeffrey B. Remmel
  • Richard A. Shore
  • Moss E. Sweedler

Part of the Progress in Computer Science and Applied Logic book series (PCS, volume 12)

Table of contents

  1. Front Matter
    Pages i-xiv
  2. J. B. Remmel, J. N. Crossley
    Pages 1-91
  3. Jaime Bohórquez, Rodrigo Cardoso
    Pages 143-161
  4. Douglas Cenzer
    Pages 162-177
  5. Gregory Cherlin, Gary Martin
    Pages 178-193
  6. John N. Crossley, John C. Shepherdson
    Pages 222-288
  7. J. C. E. Dekker
    Pages 289-313
  8. R. G. Downey, Jeffrey B. Remmel
    Pages 314-351
  9. William Gasarch, Georgia Martin
    Pages 352-385
  10. Xiaolin Ge, J. Ian Richards
    Pages 386-421
  11. B. M. Khoussainov, R. Dadajanov
    Pages 438-466
  12. Kyriakos Kontostathis
    Pages 467-489
  13. S. Lempp, M. Lerman, F. Weber
    Pages 512-554
  14. Robert S. Lubarsky
    Pages 555-571

About this book


The twenty-six papers in this volume reflect the wide and still expanding range of Anil Nerode's work. A conference on Logical Methods was held in honor of Nerode's sixtieth birthday (4 June 1992) at the Mathematical Sciences Institute, Cornell University, 1-3 June 1992. Some of the conference papers are here, but others are from students, co-workers and other colleagues. The intention of the conference was to look forward, and to see the directions currently being pursued, in the development of work by, or with, Nerode. Here is a brief summary of the contents of this book. We give a retrospective view of Nerode's work. A number of specific areas are readily discerned: recursive equivalence types, recursive algebra and model theory, the theory of Turing degrees and r.e. sets, polynomial-time computability and computer science. Nerode began with automata theory and has also taken a keen interest in the history of mathematics. All these areas are represented. The one area missing is Nerode's applied mathematical work relating to the environment. Kozen's paper builds on Nerode's early work on automata. Recursive equivalence types are covered by Dekker and Barback, the latter using directly a fundamental metatheorem of Nerode. Recursive algebra is treated by Ge & Richards (group representations). Recursive model theory is the subject of papers by Hird, Moses, and Khoussainov & Dadajanov, while a combinatorial problem in recursive model theory is discussed in Cherlin & Martin's paper. Cenzer presents a paper on recursive dynamics.


Equivalence Problem solving algorithm algorithms automata automata theory calculus combinatorics computability computer science decidability logic model theory proof semantics

Editors and affiliations

  • John N. Crossley
    • 1
  • Jeffrey B. Remmel
    • 2
  • Richard A. Shore
    • 3
  • Moss E. Sweedler
    • 3
  1. 1.Dept. of Mathematics / Comp. ScienceMonash UniversityClaytonAustralia
  2. 2.Dept. of MathematicsUniversity of California at San DiegoLa JollaUSA
  3. 3.Mathematical Sciences InstituteCornell UniversityIthacaUSA

Bibliographic information

Industry Sectors