Logic Colloquium '02

Zoe Chatzidakis Department of Mathematics University of Paris 7 Peter Koepke Mathematical Institute University of Bonn Wolfram Pohlers Institute for Mathematical Logic and Foundational Research University of Munster

Preface, Participants Photograph, Generic absoluteness for ?? formulas and the continuum problem, Axioms of generic absoluteness, Generalised dynamic ordinals — universal measures for implicit computational complexity, The Worm principle, “One is a lonely number”: logic and communication, Computable versions of the uniform boundedness theorem, Symmetry of the universal computable function: A study of its automorphisms, homomorphisms and isomorphic embeddings, PCF theory and Woodin cardinals, Embedding finite lattices into the computably enumerable degrees — a status survey, Dimension theory inside a homogeneous model, Reals which compute little, Bisimulation invariance and finite models, Choice principles in constructive and classical set theories, Ash’s theorem for abstract structures, Martin-Lof random and PA-complete sets, Learning and computing in the limit