How to Order

For AMS eBook frontlist subscriptions or backfile collection purchases:

   1a. To purchase any ebook backfile or to subscibe to the current year of Contemporary Mathematics, please download this required license agreement,

   1b. To subscribe to the current year of Memoirs of the AMS, please download this required license agreement.

   2. Complete and sign the license agreement.

   3. Email, fax, or send via postal mail to:

Customer Services
American Mathematical Society
201 Charles Street Providence, RI 02904-2213  USA
Phone: 1-800-321-4AMS (4267)
Fax: 1-401-455-4046
Email: cust-serv@ams.org

Visit the AMS Bookstore for individual volume purchases.

Browse the current eBook Collections price list

Powered by MathJax
  Remote Access

Generalized descriptive set theory and classification theory


About this Title

Sy-David Friedman, Tapani Hyttinen and Vadim Kulikov

Publication: Memoirs of the American Mathematical Society
Publication Year: 2014; Volume 230, Number 1081
ISBNs: 978-0-8218-9475-0 (print); 978-1-4704-1671-3 (online)
DOI: http://dx.doi.org/10.1090/memo/1081
Published electronically: December 16, 2013

View full volume PDF

View other years and numbers:

Table of Contents


Chapters

  • Chapter 1. History and Motivation
  • Chapter 2. Introduction
  • Chapter 3. Borel Sets, ${\Delta _1^1}$ Sets and Infinitary Logic
  • Chapter 4. Generalizations From Classical Descriptive Set Theory
  • Chapter 5. Complexity of Isomorphism Relations
  • Chapter 6. Reductions
  • Chapter 7. Open Questions

Abstract


Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized Baire and Cantor spaces, equivalence relations and their Borel reducibility. The study shows that the descriptive set theory looks very different in this generalized setting compared to the classical, countable case. We also draw the connection between the stability theoretic complexity of first-order theories and the descriptive set theoretic complexity of their isomorphism relations. Our results suggest that Borel reducibility on uncountable structures is a model theoretically natural way to compare the complexity of isomorphism relations. Acknowledgement: The authors wish to thank the John Templeton Foundation for its generous support through its project Myriad Aspects of Infinity (ID #13152). The authors wish to thank also Mittag-Leffler Institute (the Royal Swedish Academy of Sciences). The second and the third authors wish to thank the Academy of Finland for its support through its grant number 1123110. The third author wants to express his gratitude to the Research Foundation of the University of Helsinki and the Finnish National Graduate School in Mathematics and its Applications for the financial support during the work. We are grateful to Jouko Väänänen for the useful discussions and comments he provided on a draft of this paper.

References [Enhancements On Off] (What's this?)