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 New Constitutionalism and World Order by
Cover of the book The Nature of Human Creativity by
Cover of the book Origen: Contra Celsum by
Cover of the book The Competitive Advantage of Emerging Market Multinationals by
Cover of the book Resisting the European Court of Justice by
Cover of the book The Fight over Digital Rights by
Cover of the book Seismic Reflections of Rock Properties by
Cover of the book Towards the Development of the International Penal System by
Cover of the book The Cambridge Introduction to Christopher Marlowe by
Cover of the book Bringing Sociology to International Relations by
Cover of the book The Social World of Intellectuals in the Roman Empire by
Cover of the book The Cambridge Companion to William James by
Cover of the book Making Sense of Mass Education by
Cover of the book The Cambridge Introduction to American Literary Realism by
Cover of the book The Philosophy of Tragedy 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