1st Edition

Logic Colloquium '02 Lecture Notes in Logic 27

Edited By Zoé Chatzidakis, Peter Koepke, Wolfram Pohlers Copyright 2006
    370 Pages
    by A K Peters/CRC Press

    376 Pages
    by A K Peters/CRC Press

    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.

    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


    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