Logic Colloquium '02 includes articles from some of the world's preeminent logicians. The topics span all areas of mathematical logic, but with an emphasis on Computability Theory and Proof Theory. This book will be of interest to graduate students and researchers in the field of mathematical logic.
Abstract: Logic Colloquium '02 includes articles from some of the world's preeminent logicians. The topics span all areas of mathematical logic, but with an emphasis on Computability Theory and Proof Theory. This book will be of interest to graduate students and researchers in the field of mathematical logic
Content: Chapter David Aspero Generic absoluteness for ?? formulas and the continuum problem --
chapter Joan Bagaria Axioms of generic absoluteness --
chapter Arnold Beckmann Generalised dynamic ordinals ? universal measures for implicit computational complexity --
chapter Lev D. Beklemishev The Worm principle --
chapter Johan van Benthem "One is a lonely number": logic and communication --
chapter Vasco Brattka Computable versions of the uniform boundedness theorem --
chapter Elias E Combarro Symmetry of the universal computable function: A study of its automorphisms, homomorphisms and isomorphic embeddings --
chapter Moti Gitik, Ralf Schindler, and Saharon Shelah PCF theory and Woodin cardinals --
chapter Steffen Lempp, Manuel Lerman, and Reed Solomon Embedding finite lattices into the computably enumerable degrees ? a status survey --
chapter Olivier Lessmann Dimension theory inside a homogeneous m odel --
chapter Andre Nies Reals which compute little --
chapter Martin Otto Bisimulation invariance and finite models --
chapter Michael Rathjen Choice principles in constructive and classical set theories --
chapter Ivan N. Soskov and Vessela Baleva Ash's theorem for abstract structures --
chapter Frank Stephan Martin-Lof random and PA-complete sets --
chapter Sebastiaan A. Terwijn Learning and computing in the lim it.
