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.
Format:Hardcover
Language:English
ISBN:1107014514
ISBN13:9781107014510
Release Date:December 2013
Publisher:Cambridge University Press
Length:204 Pages
Weight:1.05 lbs.
Dimensions:0.7" x 6.0" x 9.1"
Recommended
Format: Hardcover
Condition: New
$144.63
Save $6.37!
List Price $151.00
On Backorder
If the item is not restocked at the end of 90 days, we will cancel your backorder and issue you a refund.
ThriftBooks sells millions of used books at the lowest everyday prices. We personally assess every book's quality and offer rare, out-of-print treasures. We deliver the joy of reading in recyclable packaging with free standard shipping on US orders over $15. ThriftBooks.com. Read more. Spend less.