Models and Computability de S. Barry Cooper

Models and Computability: London Mathematical Society Lecture Note Series, cartea 259

S. Barry Cooper

John K. Truss

en Limba Engleză Paperback – 16 iun 1999

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.

Citește tot Restrânge

Din seria London Mathematical Society Lecture Note Series

11%

Preț: 570^.40 lei
11%

Preț: 451^.68 lei
8%

Preț: 446^.84 lei
8%

Preț: 423^.02 lei
14%

Preț: 1158^.05 lei
8%

Preț: 448^.26 lei
Preț: 349^.77 lei
8%

Preț: 389^.36 lei
9%

Preț: 710^.04 lei
8%

Preț: 410^.19 lei
8%

Preț: 402^.16 lei
14%

Preț: 307^.93 lei
14%

Preț: 384^.07 lei
Preț: 295^.14 lei
8%

Preț: 411^.74 lei
8%

Preț: 521^.92 lei
11%

Preț: 586^.77 lei
8%

Preț: 410^.54 lei
11%

Preț: 655^.54 lei
11%

Preț: 448^.34 lei
8%

Preț: 531^.20 lei
8%

Preț: 496^.08 lei
11%

Preț: 659^.72 lei
11%

Preț: 552^.17 lei
14%

Preț: 675^.41 lei
11%

Preț: 472^.44 lei
Preț: 298^.40 lei
Preț: 430^.97 lei
11%

Preț: 468^.96 lei
Preț: 305^.49 lei
Preț: 302^.67 lei
Preț: 299^.88 lei
Preț: 304^.57 lei
Preț: 306^.18 lei
11%

Preț: 469^.29 lei
Preț: 421^.94 lei
Preț: 303^.26 lei
Preț: 300^.09 lei
11%

Preț: 422^.35 lei
Preț: 385^.23 lei
Preț: 430^.06 lei
11%

Preț: 403^.49 lei
Preț: 384^.87 lei
Preț: 337^.64 lei
11%

Preț: 403^.83 lei
Preț: 293^.14 lei
Preț: 382^.61 lei
11%

Preț: 443^.51 lei
11%

Preț: 467^.79 lei
11%

Preț: 554^.34 lei

Cuprins

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.