Together, Models and Computability and its sister volume Sets and Proofs 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.
Author(s): S. Barry Cooper, John K. Truss
Series: London Mathematical Society Lecture Note Series 259
Publisher: CUP
Year: 1999
Language: English
Pages: 430
Title Page ......Page 3
Copyright ......Page 4
Contents ......Page 5
Preface ......Page 7
Continuous Functionals of Dependent and Transfinite Types ......Page 11
Degree-Theoretic Aspects of Computably Enumerable Reals ......Page 33
Simplicity and Independence for Pseudo-Algebraically Closed Fields ......Page 51
Clockwork or Turing U/universe? - Remarks on Causal Determinism and Computability ......Page 73
A Techniques Oriented Survey of Bounded Queries ......Page 127
Relative Categoricity in Abelian Groups ......Page 167
Computability and Complexity Revisited ......Page 179
Effective Model Theory: The Number of Models and Their Complexity ......Page 203
A Survey on Canonical Bases in Simple Theories ......Page 251
True Approximations and Models of Arithmetic ......Page 265
On the Topological Stability Conjecture ......Page 289
A Mahlo-Universe of Effective Domains with Totality ......Page 303
Logic and Decision Making ......Page 323
The Sheaf of Locally Definable Scalars over a Ring ......Page 349
Human Styles of Quantificational Reasoning ......Page 363
Recursion Theoretic Memories 1954-1978 ......Page 377
Fields Definable in Simple Groups ......Page 387
A Combinatory Algebra for Sequential Functionals of Finite Type ......Page 399
Model Theory of Analytic and Smooth Functions ......Page 417
Cover ......Page 430
