Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Sets and Proofs

Sets and Proofs

Sets and Proofs

S. Barry Cooper, University of Leeds
John K. Truss, University of Leeds
August 1999
Paperback
9780521635493
$70.99
USD
Paperback
USD
eBook

    Together, Sets and Proofs and its sister volume Models and Computability will provide readers with a comprehensive guide to the current state of 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, postgraduate researchers, and the informed and interested nonspecialist.

    • Indispensable for researchers in this area
    • Authors are top names
    • Broad coverage of topics

    Reviews & endorsements

    '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 Mathématique

    See more reviews

    Product details

    August 1999
    Paperback
    9780521635493
    448 pages
    229 × 152 × 25 mm
    0.65kg
    Available

    Table of Contents

    • 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. Löwe 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.
      Contributors
    • T. Arai, P. Benacerraf, R. Dyckhoff, L. F. Pinto, S. D. Friedman, J. Hudelmaier, P. Koepke, B. Löwe, J. R. Steel, I. Neeman, P. Pudlak, M. Rathjen, E. Schimmerling, A. Setzer, S. Solecki, M. C. Stanley, T. Strahm, A. Weiermann, P. D. Welch

    • Editors
    • S. Barry Cooper , University of Leeds
    • John K. Truss , University of Leeds