Together, Sets and Proofs and its sister volume Models and Computability will provide readers with a comprehensive guide to mathematical logic. All the authors are leaders in their fields and are drawn from the invited speakers at 'Logic Colloquium '97' (the major international meeting of the Association of Symbolic Logic). It is expected that the breadth and timeliness of these two volumes will prove an invaluable and unique resource for specialists, post-graduate researchers, and the informed and interested nonspecialist.
Rezensionen / Stimmen
'All the authors are leaders in their fields, some articles pushing forward the technical boundaries of the subject, others providing readable and authoritative overviews of particular important topics ... a number of papers can be expected to become classics, essential to any good library (individual or institutional).' Extrait de L'Enseignement Mathematique
Reihe
Sprache
Verlagsort
Zielgruppe
Produkt-Hinweis
Illustrationen
Worked examples or Exercises
Maße
Höhe: 229 mm
Breite: 152 mm
Dicke: 26 mm
Gewicht
ISBN-13
978-0-521-63549-3 (9780521635493)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
1. An introduction to finitary analyses of proof figures T. Arai; 2. What mathematical truth could not be - II P. Benacerraf; 3. Proof search in constructive logics R. Dyckhoff and L. F. Pinto; 4. David's trick S. D. Friedman; 5. A semantical calculus for intuitionistic propositional logic J. Hudelmaier; 6. An iteration model violating the singular cardinals hypothesis P. Koepke; 7. An introduction to core model theory B. Loewe and J. R. Steel; 8. Games of countable length I. Neeman; 9. On the complexity of the propositional calculus P. Pudlak; 10. The realm of ordinal analysis M. Rathjen; 11. Covering properties of core models E. Schimmerling; 12. Ordinal systems A. Setzer; 13. Polish group topologies S. Solecki; 14. Forcing closed unbounded subsets of Nw+1 M. C. Stanley; 15. First steps into metapredicativity in explicit mathematics T. Strahm; 16. What makes a (pointwise) subrecursive hierarchy slow growing? A. Weiermann; 17. Minimality arguments for infinite time Turing degrees P. D. Welch.
