Effective Mathematics of the Uncountable
By: and and and
Sign Up Now!
Already a Member? Log In
You must be logged into Bookshare to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 2013
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9781107521186
- Publisher:
- Cambridge University Press
- Date of Addition:
- 10/30/13
- Copyrighted By:
- Association for Symbolic Logic
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Mathematics and Statistics, Philosophy
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.
Reviews
Other Books
- by Noam Greenberg
- by Joel David Hamkins
- by Denis Hirschfeldt
- by Russell Miller
- in Nonfiction
- in Mathematics and Statistics
- in Philosophy