Effective Mathematics of the Uncountable

Erscheinungsjahr 2013
ISBN: 978-1-107-01451-0
Verlag: Cambridge University Press

Buch, Englisch, Band 41, 204 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 493 g

Reihe: Lecture Notes in Logic

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.

Autoren/Hrsg.

Greenberg, Noam

Hirschfeldt, Denis

Hamkins, Joel David

Miller, Russell

Fachgebiete

• Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Computeranwendungen in der Mathematik
• Mathematik | Informatik EDV | Informatik Informatik Berechenbarkeitstheorie, Komplexitätstheorie

Inhaltsverzeichnis

List of contributors; Preface; 1. Introduction; 2. Borel structures: a brief survey Antonio Montalbán and André Nies; 3. Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals Samuel Coskey and Joel David Hamkins; 4. Some results on R-computable structures W. Calvert and J. E. Porter; 5. Effective model theory via the S-definability approach Alexey Stukachev; 6. Computable structure theory using admissible recursion theory on ?1 Noam Greenberg and Julia F. Knight; 7. E-recursive intuitions Gerald E. Sacks; 8. Local computability and uncountable structures Russell Miller; 9. Reverse mathematics, countable and uncountable: a computational approach Richard A. Shore.

Über Autor(innen)

Miller, Russell
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.

Hirschfeldt, Denis
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.

Hamkins, Joel David
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.

Greenberg, Noam
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.

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.