Models and computability : invited papers from Logic Colloquium '97 - European Meeting of the Association for Symbolic Logic, Leeds, July 1997
Logic Colloquium, S. Barry Cooper, JOHN KENNETH TRUSS · Cambridge University Press eBooks · 1999
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.