Logic Colloquium '02
$98.00 ( ) USD
Part of Lecture Notes in Logic
- Zoé Chatzidakis, Université de Paris VII (Denis Diderot)
- Peter Koepke, Rheinische Friedrich-Wilhelms-Universität Bonn
- Wolfram Pohlers, Westfälische Wilhelms-Universität Münster, Germany
Adobe eBook Reader
Looking for an examination copy?
If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact firstname.lastname@example.org providing details of the course you are teaching.
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 Münster, 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.Read more
- Contains the proceedings of two major international logic meetings held in 2002
- Covers all areas of mathematical logic, written by leaders in the field
- Of interest to all researchers and graduate students in mathematical logic
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Publication planned for: April 2020
- format: Adobe eBook Reader
- isbn: 9781108631679
- contains: 12 b/w illus.
- availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
Table of Contents
1. Generic absoluteness for Σ1 formulas and the continuum problem David Asperó
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 Elías 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 André 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-Löf random and PA-complete sets Frank Stephan
16. Learning and computing in the limit Sebastiaan A. Terwijn.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in