Models and Computability
Part of London Mathematical Society Lecture Note Series
- Editors:
- S. Barry Cooper, University of Leeds
- John K. Truss, University of Leeds
- Date Published: August 1999
- availability: Available
- format: Paperback
- isbn: 9780521635509
Paperback
Other available formats:
eBook
Looking for an inspection copy?
Please email [email protected] to enquire about an inspection copy of this book
-
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.
Read more- 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
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: August 1999
- format: Paperback
- isbn: 9780521635509
- length: 430 pages
- dimensions: 229 x 154 x 25 mm
- weight: 0.6kg
- availability: Available
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.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×