Models and computability : invited papers from Logic Colloquium '97, European Meeting of the Association for Symbolic Logic, Leeds, July 1997 [E-Book] / edited by S. Barry Cooper, John K. Truss.
Cooper, S. B., (editor)
Truss, J. K., (editor)
Cambridge : Cambridge University Press, 1999
1 online resource (ix, 419 pages)
englisch
9780511565670
9780521635509
London Mathematical Society lecture note series ; 259
Full Text
Table of Contents:
  • Continuous functionals of dependent and transfinite types /
  • U. Berger
  • Degree-theoretic aspects of computably enumerable reals /
  • C.S. Calude [and others]
  • Simplicity and independence for pseudo-algebraically closed fields /
  • Z. Chatzidakis
  • Clockwork or turing U/universe?
  • remarks on causal determinism and computability /
  • S.B. Cooper
  • Techniques oriented survey of bounded queries /
  • W. Gasarch and F. Stephan
  • Relative categoricity in abelian groups /
  • W.A. Hodges
  • Computability and complexity revisited /
  • N.D. Jones
  • Effective model theory : the number of models and their complexity /
  • B. Khoussainov and R.A. Shore
  • Survey on canonical bases in simple theories /
  • B. Kim
  • True approximations and models of arithmetic /
  • J.F. Knight
  • On the topological stability conjecture /
  • L. Newelski
  • Mahlo-universe of effective domains with totality /
  • D. Normann
  • Logic and decision making /
  • D.E. Over
  • Sheaf of locally definable scalars over a ring /
  • M.Y. Prest
  • Human styles of quantificational reasoning /
  • L.J. Rips
  • Recursion theoretic memories 1954-1978 /
  • G.E. Sacks
  • Fields definable in simple groups /
  • K. Tent
  • Combinatory algebra for sequential functionals of finite type /
  • J. Van Oosten
  • Model theory of analytic and smooth functions /
  • A.J. Wilkie.