EFFECTIVE MATHEMATICS OF THE UNCOUNTABLE by Noam Greenberg (Editor), Denis Hirschfeldt (Editor), Joel David Hamkins (Editor) ( 9781107014510 )

Item Details

Title:

EFFECTIVE MATHEMATICS OF THE UNCOUNTABLE

By:

Noam Greenberg (Editor), Denis Hirschfeldt (Editor), Joel David Hamkins (Editor)

Format:

Hardback

List price:

£111.00

Our price:

£99.90

Discount:

10% off

You save:

£11.10

ISBN 10:

1107014514

ISBN 13:

9781107014510

Availability:

Usually dispatched within 1-3 weeks.

Delivery rates

Stock:

Currently 0 available

Publisher:

CAMBRIDGE UNIVERSITY PRESS

Pub. date:

31 October, 2013

Series:

Lecture Notes in Logic 41

Pages:

204

Description:

A comprehensive introduction to eight major approaches to computation on uncountable mathematical domains.

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.

Publication:

Imprint:

Cambridge University Press

Returns:

Returnable

Some other items by this author:

ALGEBRAIC CURVES AND RIEMANN SURFACES FOR UNDERGRADUATES

ASPECTS OF COMPLEXITY

ASPECTS OF COMPLEXITY (HB)

COMPUTABILITY AND COMPLEXITY (PB)

LECTURES ON THE PHILOSOPHY OF MATHEMATICS

PROOF AND THE ART OF MATHEMATICS