Models and Computability

doi:10.1017/CBO9780511565670

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.

‘ … will prove an invaluable and unique resource for specialists, post-graduate researchers, and the informed and interested nonspecialist.’

Source: Extrait de L’Enseignement Mathématique

- Aa Reduce text
- Aa Enlarge text

View selected items
Save to my bookmarks
Export citations
Download PDF (zip)
Save to Kindle
Save to Dropbox
Save to Google Drive
Save content to
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to .

To save content items to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Please be advised that item(s) you selected are not available.
You are about to save
Your Kindle email address

Please provide your Kindle email.

@free.kindle.com @kindle.com (service fees apply)

By using this service, you agree that you will only keep content for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services

Contents

Frontmatter
pp i-iv
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Contents
pp v-vi
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Preface
pp vii-x
- By S. Barry Cooper, Leeds, John K. Truss, Leeds
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Continuous Functionals of Dependent and Transfinite Types
pp 1-22
- By Ulrich Berger, Mathematisches Institut der Universität München
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Degree-Theoretic Aspects of Computably Enumerable Reals
pp 23-40
- By Cristian S. Calude, Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand, {cristian,coles,hertling,bmk}, Richard Coles, Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand, {cristian,coles,hertling,bmk}, Peter H. Hertling, Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand, {cristian,coles,hertling,bmk}, Bakhadyr Khoussainov, Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand, {cristian,coles,hertling,bmk}
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Simplicity and Independence for Pseudo-Algebraically Closed Fields
pp 41-62
- By Zoé Chatzidakis, CNRS - Paris 7
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Clockwork or Turing U/universe? - Remarks on Causal Determinism and Computability
pp 63-116
- By S. Barry Cooper, University of Leeds, Leeds LS2 9JT, England
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

A Techniques Oriented Survey of Bounded Queries
pp 117-156
- By William Gasarch, University of Maryland, Frank Stephan, University of Heidelberg
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Relative Categoricity in Abelian Groups
pp 157-168
- By Wilfrid Hodges, Queen Mary & Westfield College, London E1 4NS
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Computability and Complexity Revisited
pp 169-192
- By Neil D. Jones, DIKU, University of Copenhagen, Denmark, E-mail, web: neil@diku.dk,http://www.diku.dk/people/NDJ.html
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Effective Model Theory: The Number of Models and Their Complexity
pp 193-240
- By Bakhadyr Khoussainov, Cornell University, Ithaca NY 14853, University of Aukland, Aukland New Zealand, Richard A. Shore, Cornell University, Ithaca NY 14853
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

A Survey on Canonical Bases in Simple Theories
pp 241-254
- By Byunghan Kim
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

True Approximations and Models of Arithmetic
pp 255-278
- By Julia F. Knight, University of Notre Dame
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

On the Topological Stability Conjecture
pp 279-292
- By Ludomir Newelski, Mathematical Institute of Wroclaw University, Mathematical Institute of the Polish Academy of Sciences
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

A Mahlo-Universe of Effective Domains with Totality
pp 293-312
- By Dag Normann
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Logic and Decision Making
pp 313-338
- By David E. Over, University of Sunderland
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

The Sheaf of Locally Definable Scalars over a Ring
pp 339-352
- By Mike Prest, Department of Mathematics, University of Manchester, Manchester M13 9PL, UK
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Human Styles of Quantificational Reasoning
pp 353-366
- By Lance J. Rips, Northwestern University
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Recursion Theoretic Memories 1954–1978
pp 367-376
- By Gerald E. Sacks
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Fields Definable in Simple Groups
pp 377-388
- By Katrin Tent, Mathematisches Institut, Universität Würzburg, 97074 Würzburg, Germany
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

A Combinatory Algebra for Sequential Functionals of Finite Type
pp 389-406
- By Jaap van Oosten, Department of Mathematics, Utrecht University, The Netherlands, jvoosten
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Model Theory of Analytic and Smooth Functions
pp 407-419
- By Alex J. Wilkie, Mathematical Institute, Oxford
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation

Metrics

Altmetric attention score

Total number of HTML views: 0

Total number of PDF views: 0 *

Loading metrics...

Total views: 0 *

Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.

Why this information is here

This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

Accessibility Information

Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.

Models and Computability

This Book has been cited by the following publications. This list is generated based on data provided by Crossref.

Book description

Reviews

Refine List

Actions for selected content:

Contents

Frontmatter
pp i-iv

Contents
pp v-vi

Preface
pp vii-x

Continuous Functionals of Dependent and Transfinite Types
pp 1-22

Degree-Theoretic Aspects of Computably Enumerable Reals
pp 23-40

Simplicity and Independence for Pseudo-Algebraically Closed Fields
pp 41-62

Clockwork or Turing U/universe? - Remarks on Causal Determinism and Computability
pp 63-116

A Techniques Oriented Survey of Bounded Queries
pp 117-156

Relative Categoricity in Abelian Groups
pp 157-168

Computability and Complexity Revisited
pp 169-192

Effective Model Theory: The Number of Models and Their Complexity
pp 193-240

A Survey on Canonical Bases in Simple Theories
pp 241-254

True Approximations and Models of Arithmetic
pp 255-278

On the Topological Stability Conjecture
pp 279-292

A Mahlo-Universe of Effective Domains with Totality
pp 293-312

Logic and Decision Making
pp 313-338

The Sheaf of Locally Definable Scalars over a Ring
pp 339-352

Human Styles of Quantificational Reasoning
pp 353-366

Recursion Theoretic Memories 1954–1978
pp 367-376

Fields Definable in Simple Groups
pp 377-388

A Combinatory Algebra for Sequential Functionals of Finite Type
pp 389-406

Model Theory of Analytic and Smooth Functions
pp 407-419

Metrics

Altmetric attention score

Full text views

Book summary page views

Accessibility standard: Unknown

Why this information is here

Accessibility Information

Models and Computability

Book description

Reviews

Refine List

Actions for selected content:

Save Search

Contents

Metrics

Altmetric attention score

Full text views

Book summary page views

Accessibility standard: Unknown

Why this information is here

Accessibility Information