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 twenty-seventh publication in the Lecture Notes in Logic series, contains the proceedings of two conferences: the European Summer Meeting of the Association for Symbolic Logic and the Colloquium Logicum, held in Muenster, Germany in August, 2002. This compilation of articles from some of the world's preeminent logicians spans all areas of mathematical logic, including philosophical logic and computer science logic. It contains expanded versions of a number of invited plenary talks and tutorials that will be of interest to graduate students and researchers in the field of mathematical logic.
Reihe
Sprache
Verlagsort
Zielgruppe
Illustrationen
Worked examples or Exercises; 3 Halftones, black and white; 9 Line drawings, black and white
Dateigröße
ISBN-13
978-1-108-63167-9 (9781108631679)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Zoe Chatzidakis is a researcher at the Centre national de la recherche scientifique (CNRS), attached to the Universite Paris 7, France. She works on model theory applied to algebraic structures. Peter Koepke is a Professor at the Rheinische Friedrich-Wilhelms-Universitaet Bonn, Germany. His research concentrates on set theory and inner models. Wolfram Pohlers is a Professor at the Institut fuer Mathematische Logik und Grundlagenforschung, Muenster, Germany. His research focuses on infinitary proof theory and its applications.
Herausgeber*in
Universite de Paris VII (Denis Diderot)
Rheinische Friedrich-Wilhelms-Universitaet Bonn
Westfaelische Wilhelms-Universitaet Muenster, Germany
Preface; Participants photograph; 1. Generic absoluteness for ?1 formulas and the continuum problem David Aspero; 2. Axioms of generic absoluteness Joan Bagaria; 3. Generalised dynamic ordinals - universal measures for implicit computational complexity Arnold Beckmann; 4. The Worm principle Lev D. Beklemishev; 5. 'One is a lonely number': logic and communication Johan van Benthem; 6. Computable versions of the uniform boundedness theorem Vasco Brattka; 7. Symmetry of the universal computable function: a study of its automorphisms, homomorphisms and isomorphic embeddings Elias F. Combarro; 8. PCF theory and Wooodin cardinals Moti Gitik, Ralf Schindler and Saharon Shelah; 9. Embedding finite lattices into the computably enumerable degrees - a status survey Steffen Lempp, Manuel Lerman and Reed Solomon; 10. Dimension theory inside a homogeneous model Olivier Lessmann; 11. Reals which compute little Andre Nies; 12. Bisimulation invariance and finite models Martin Otto; 13. Choice principles in constructive and classical set theories Michael Rathjen; 14. Ash's theorem for abstract structures Ivan N. Soskov and Vessela Baleva; 15. Martin-Loef random and PA-complete sets Frank Stephan; 16. Learning and computing in the limit Sebastiaan A. Terwijn.
