Anil Nerode has had a wide influence on logic and computer science since the 1960's. This volume reflects his inspiration and also the variety of interests which he has. The papers in this book are principally concerned with mathematical logic and some of its applications in computing. The book contains papers on recursion theory, intuitionism, computability in group theory, recursive model theory, reverse mathematics, and the extraction of programs from proofs.

Included also is a thorough survey of Nerode's technical achievements over the last 30 years.

Any logician should find something, and most probably many items, of interest. We note particularly new developments in the understanding of the property of intuitionistic set theory and intuitionistic analysis, the extension of computability in ordinary mathematics pioneered by Marian Boyka Pour-El and Ian Richards, the proof-theoretic strength of a long-standing conjecture of Fraisse, and an extension and further account of the Curry-Howard method of extracting programs from logical proofs.

The papers in general arose from the conference "Logical Methods in Mathematics and Computer Science. A Symposium in Honor of Anil Nerode on the Occasion of his Sixtieth Birthday" at the Mathematical Sciences Institute, Cornell University, from June 1-3, 1992. This conference was attended by over 100 participants and reflects the range and influence of Anil's work.