Effective Mathematics of the Uncountable

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