Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist

Effective Mathematics of the Uncountable

$88.00 (C)

Part of Lecture Notes in Logic

Antonio Montalbán, André Nies, Samuel Coskey, Joel David Hamkins, W. Calvert, J. E. Porter, Alexey Stukachev, Noam Greenberg, Julia F. Knight, Gerald E. Sacks, Russell Miller, Richard A. Shore
View all contributors
  • Date Published: December 2013
  • availability: In stock
  • format: Hardback
  • isbn: 9781107014510

$ 88.00 (C)
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Classical computable model theory is most naturally concerned with countable domains. There are, however, several methods – some old, some new – that have extended its basic concepts to uncountable structures. Unlike in the classical case, however, no single dominant approach has emerged, and different methods reveal different aspects of the computable content of uncountable mathematics. This book contains introductions to eight major approaches to computable uncountable mathematics: descriptive set theory; infinite time Turing machines; Blum-Shub-Smale computability; Sigma-definability; computability theory on admissible ordinals; E-recursion theory; local computability; and uncountable reverse mathematics. This book provides an authoritative and multifaceted introduction to this exciting new area of research that is still in its early stages. It is ideal as both an introductory text for graduate and advanced undergraduate students, and a source of interesting new approaches for researchers in computability theory and related areas.

    • Will appeal to graduate students, advanced undergraduates and researchers
    • Brings together many different notions of computability for the first time
    • Written by pioneering researchers in the field
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: December 2013
    • format: Hardback
    • isbn: 9781107014510
    • length: 204 pages
    • dimensions: 235 x 155 x 16 mm
    • weight: 0.48kg
    • availability: In stock
  • Table of Contents

    List of contributors
    Preface
    1. Introduction
    2. Borel structures: a brief survey Antonio Montalbán and André Nies
    3. Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals Samuel Coskey and Joel David Hamkins
    4. Some results on R-computable structures W. Calvert and J. E. Porter
    5. Effective model theory via the Σ-definability approach Alexey Stukachev
    6. Computable structure theory using admissible recursion theory on ω1 Noam Greenberg and Julia F. Knight
    7. E-recursive intuitions Gerald E. Sacks
    8. Local computability and uncountable structures Russell Miller
    9. Reverse mathematics, countable and uncountable: a computational approach Richard A. Shore.

  • Editors

    Noam Greenberg, Victoria University of Wellington
    Noam Greenberg is a Rutherford Discovery Fellow of the Royal Society of New Zealand where his research interests include computability theory, algorithmic randomness, reverse mathematics, higher recursion theory, computable model theory and set theory.

    Denis Hirschfeldt, University of Chicago
    Denis Hirschfeldt is a Professor of Mathematics at the University of Chicago and has previously held visiting positions at the University of Wisconsin, Madison and the University of Notre Dame. He was a recipient of the 2010 Sacks Prize of the Association for Symbolic Logic for expository writing.

    Joel David Hamkins, College of Staten Island
    Joel David Hamkins is a professor at the City University of New York and has held visiting positions at the University of California, Berkeley, Kobe University, Carnegie Mellon University, the University of Muenster, the University of Amsterdam and New York University.

    Russell Miller, Queens College, City University of New York
    Russell Miller holds an appointment as Professor of Mathematics jointly between Queens College and the CUNY Graduate Center. His research applies computability to other areas of mathematics, including model theory, set theory, commutative algebra, differential algebra, graph theory and topology.

    Contributors

    Antonio Montalbán, André Nies, Samuel Coskey, Joel David Hamkins, W. Calvert, J. E. Porter, Alexey Stukachev, Noam Greenberg, Julia F. Knight, Gerald E. Sacks, Russell Miller, Richard A. Shore

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×