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


Models and Computability

Models and Computability

Models and Computability

S. Barry Cooper, University of Leeds
John K. Truss, University of Leeds
February 2011
Adobe eBook Reader
9780511894343
c.
$70.99
USD
Adobe eBook Reader
USD
Paperback

    Together, Models and Computability and its sister volume Sets and Proofs 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, post-graduate researchers, and the informed and interested nonspecialist.

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

    Reviews & endorsements

    ' … will prove an invaluable and unique resource for specialists, post-graduate researchers, and the informed and interested nonspecialist.' Extrait de L'Enseignement Mathématique

    See more reviews

    Product details

    February 2011
    Adobe eBook Reader
    9780511894343
    0 pages
    0kg
    This ISBN is for an eBook version which is distributed on our behalf by a third party.

    Table of Contents

    • 1. Continuous functionals of dependent and transfinite types U. Berger
    • 2. Degree-theoretic aspects of computably enumerable reals C. S. Claude, R. Coles, P. H. Hertling and B. Khoussainov
    • 3. Simplicity and independence for pseudo-algebraically closed fields Z. Chatzidakis
    • 4. Clockwork or Turing universe? - remarks on causal determinism and computability S. B. Cooper
    • 5. A techniques-oriented survey of bounded queries W. Gasarch and F. Stephan
    • 6. Relative categoricity in abelian groups W. A. Hodges
    • 7. Computability and complexity revisited N. D. Jones
    • 8. Effective model theory: the number of models and their complexity B. Khoussainov and R. A. Shore
    • 9. A survey on canonical bases in simple theories B. Kim
    • 10. True approximations and models of arithmetic J. F. Knight
    • 11. On the topological stability conjecture L. Newelski
    • 12. A mahlo-universe of effective domains with totality D. Normann
    • 13. Logic and decision making D. E. Over
    • 14. The sheaf of locally definable scalars over a ring M. Y. Prest
    • 15. Human styles of quantificational reasoning L. J. Rips
    • 16. Recursion theoretic memories 1954–1978 G. E. Sacks
    • 17. Fields definable in simple groups K. Tent
    • 18. A combinatory algebra for sequential functionals of finite type J. Van Oosten
    • 19. Model theory of analytic and smooth functions A. J. Wilkie.
      Contributors
    • U. Berger, C. S. Claude, R. Coles, P. H. Hertling, B. Khoussainov, Z. Chatzidakis, S. B. Cooper, W. Gasarch, F. Stephan, W. A. Hodges, R. A. Shore, B. Kim, J. F. Knight, L. Newelski, D. Normann, D. E. Over, M. Y. Prest, L. J. Rips, G. E. Sacks, K. Tent, J. Van Oosten, A. J. Wilkie

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