著者紹介

内容

目次

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 forpseudo-algebraically closed fields Z. Chatzidakis; 4. Clockwork or Turinguniverse? - 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 andcomplexity revisited N. D. Jones; 8. Effective model theory: the number ofmodels and their complexity B. Khoussainov and R. A. Shore; 9. A survey oncanonical bases in simple theories B. Kim; 10. True approximations and modelsof 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 definablescalars over a ring M. Y. Prest; 15. Human styles of quantificationalreasoning L. J. Rips; 16. Recursion theoretic memories 1954-1978 G. E. Sacks;17. Fields definable in simple groups K. Tent; 18. A combinatory algebra forsequential functionals of finite type J. Van Oosten; 19. Model theory ofanalytic and smooth functions A. J. Wilkie.