Sets and proofs : invited papers from Logic Colloquium '97 - European Meeting of the Association for Symbolic Logic, Leeds, July 1997

Author(s)

• Logic Colloquium
• Cooper, S. B. (S. Barry)
• Truss, J. K

Bibliographic Information

Sets and proofs : invited papers from Logic Colloquium '97 - European Meeting of the Association for Symbolic Logic, Leeds, July 1997

edited by S. Barry Cooper, John K. Truss

（London Mathematical Society lecture note series, 258）

Cambridge University Press, 1999

Note

Includes bibliographical references

Description and Table of Contents

Description

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.

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. 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.

by "Nielsen BookData"

Details

• NCID: BA42204088
• ISBN:
  • 0521635497
• LCCN: 99019676
• Country Code: uk
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Cambridge ; New York
• Pages/Volumes: ix, 436 p.
• Size: 23 cm
• Classification:
  • LCC : QA248
  • DC21 : 511.3/22
• Subject Headings:
  • LCSH : Set theory -- Congresses
  • LCSH : Proof theory -- Congresses
• Parent Bibliography ID:
  • BA0005393X