Effective Mathematics of the Uncountable | Agenda Bookshop Skip to content
Please note that books with a 10-20 working days delivery time may not arrive before Christmas.
Please note that books with a 10-20 working days delivery time may not arrive before Christmas.
Age Group_Uncategorized
Age Group_Uncategorized
automatic-update
B01=Denis Hirschfeldt
B01=Joel David Hamkins
B01=Noam Greenberg
B01=Russell Miller
Category1=Non-Fiction
Category=PBCD
Category=UYA
COP=United Kingdom
Delivery_Delivery within 10-20 working days
Language_English
PA=In stock
Price_€100 and above
PS=Active
softlaunch

Effective Mathematics of the Uncountable

English

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. See more
Current price €118.74
Original price €124.99
Save 5%
Age Group_Uncategorizedautomatic-updateB01=Denis HirschfeldtB01=Joel David HamkinsB01=Noam GreenbergB01=Russell MillerCategory1=Non-FictionCategory=PBCDCategory=UYACOP=United KingdomDelivery_Delivery within 10-20 working daysLanguage_EnglishPA=In stockPrice_€100 and abovePS=Activesoftlaunch
Delivery/Collection within 10-20 working days
Product Details
  • Weight: 440g
  • Dimensions: 155 x 235mm
  • Publication Date: 31 Oct 2013
  • Publisher: Cambridge University Press
  • Publication City/Country: United Kingdom
  • Language: English
  • ISBN13: 9781107014510

About

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 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 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 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.

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)
We use cookies to ensure that we give you the best experience on our website. If you continue we'll assume that you are understand this. Learn more
Accept