|
![]() |
|||
|
||||
OverviewDescriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper the authors study the generalization where countable is replaced by uncountable. They 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. They also draw the connection between the stability theoretic complexity of first-order theories and the descriptive set theoretic complexity of their isomorphism relations. The authors' results suggest that Borel reducibility on uncountable structures is a model theoretically natural way to compare the complexity of isomorphism relations. Full Product DetailsAuthor: Sy-David Friedman , Tapani Hyttinen , Vadim KulikovPublisher: American Mathematical Society Imprint: American Mathematical Society Volume: No. 230/1081 Weight: 0.200kg ISBN: 9780821894750ISBN 10: 0821894757 Pages: 80 Publication Date: 30 June 2014 Audience: Professional and scholarly , Professional and scholarly , Professional & Vocational , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Temporarily unavailable ![]() The supplier advises that this item is temporarily unavailable. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out to you. Table of ContentsHistory and motivation Introduction Borel sets, D11 sets and infinitary logic Generalizations from classical descriptive set theory Complexity of isomorphism relations Reductions Open questions BibliographyReviewsAuthor InformationSy-David Friedman, Kurt Godel Research Center, Vienna, Austria. Tapani Hyttinen, University of Helsinki, Finland. Vadim Kulikov, Kurt Godel Research Center, Vienna, Austria. Tab Content 6Author Website:Countries AvailableAll regions |