Logic Colloquium '01: (Series Number 20 Lecture Notes in Logic)

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the twentieth publication in the Lecture Notes in Logic series, contains the proceedings of the 2001 European Summer Meeting of the Association for Symbolic Logic, held at the Vienna University of Technology. Two long articles present accessible expositions on resolution theorem proving and the determinacy of long games. The remaining articles cover separate research topics in many areas of mathematical logic, including applications in computer science, proof theory, set theory, model theory, computability theory, linguistics and aspects of philosophy. This collection will interest not only mathematical logicians but also philosophical logicians, historians of logic, computer scientists, formal linguists and mathematicians working in algebra, abstract analysis and topology.

Table of Contents:
Preface; Part I. Tutorials: 1. Resolution theorem proving: a logical view Alexander Leitsch; 2. An introduction to proofs of determinacy of long games Itay Neeman; Part II. Articles: 3. Modified bar recursion and classical dependent choice Ulrich Berger and Paulo Oliva; 4. Choice and uniformity in weak applicative theories Andrea Cantini; 5. Compactness and incompactness phenomena in set theory James Cummings; 6. Selection for Borel relations Harvey M. Friedman; 7. Interpolation in goal-directed proof systems D. M. Gabbay and N. Olivetti; 8. Sequences of degrees associated with models of arithmetic Julia F. Knight; 9. The limit theory of generic polynomials Pascal Koiran; 10. Moschovakis's notion of meaning as applied to linguistics Michiel van Laambalgen and Fritz Hamm; 11. Tameness in expansions of the real field Chris Miller; 12. The model theory of compact complex spaces Rahim N. Moosa; 13. 'Natural' representations and extensions of Gödel's second theorem Karl-Georg Niebergall; 14. Effective Hausdorff dimension Jan Reimann and Frank Stephan; 15. Mutual stationarity in the core model Ralf Schindler; 16. The pair (אn, א0) may fail א0-compactness Saharon Shelah; 17. Incompleteness theorem and its frontier Gaisi Takeuti; 18. Groups in simple theories Frank Wagner; 19. Provable recursiveness and complexity S. S Wainer.

About the Author :
Matthias Baaz is currently University Professor and Head of the Group for Computational Logic at the Institute of Discrete Mathematics and Geometry at the Technische Universität Wien, Austria. Sy-David Friedman works in the Kurt Gödel Research Center for Mathematical Logic at the Universität Wien, Austria. Jan Krajíček works in the Mathematical Institute of the Academy of Sciences of the Czech Republic, Prague.