Effective Mathematics of the Uncountable

Nonfiction, Science & Nature, Mathematics, Logic, Computers, General Computing
Cover of the book Effective Mathematics of the Uncountable by , Cambridge University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: ISBN: 9781107521186
Publisher: Cambridge University Press Publication: October 31, 2013
Imprint: Cambridge University Press Language: English
Author:
ISBN: 9781107521186
Publisher: Cambridge University Press
Publication: October 31, 2013
Imprint: Cambridge University Press
Language: 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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Cambridge University Press

Cover of the book String Theory: Volume 2, Superstring Theory and Beyond by
Cover of the book Organising Music by
Cover of the book Stakeholders Matter by
Cover of the book Antigone, Interrupted by
Cover of the book Logical Fictions in Medieval Literature and Philosophy by
Cover of the book Fault Lines of International Legitimacy by
Cover of the book Numerical Solution of Differential Equations by
Cover of the book The Linguistic Typology of Templates by
Cover of the book The Smoke of London by
Cover of the book Marketing Sovereign Promises by
Cover of the book Africans by
Cover of the book Multivariate Analysis of Ecological Data using CANOCO 5 by
Cover of the book Plato's Symposium by
Cover of the book Kierkegaard: Fear and Trembling by
Cover of the book Nonequilibrium Gas Dynamics and Molecular Simulation by
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy