Logic Colloquium '02: Lecture Notes in Logic 27
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.
1138978310
Logic Colloquium '02: Lecture Notes in Logic 27
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.
61.99 In Stock
Logic Colloquium '02: Lecture Notes in Logic 27

Logic Colloquium '02: Lecture Notes in Logic 27

Logic Colloquium '02: Lecture Notes in Logic 27

Logic Colloquium '02: Lecture Notes in Logic 27

eBook

$61.99 

Available on Compatible NOOK devices, the free NOOK App and in My Digital Library.
WANT A NOOK?  Explore Now

Related collections and offers


Overview

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.

Product Details

ISBN-13: 9781040188309
Publisher: CRC Press
Publication date: 07/13/2006
Sold by: Barnes & Noble
Format: eBook
Pages: 370
File size: 3 MB

About the Author

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

Table of Contents

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
From the B&N Reads Blog

Customer Reviews