Structure and randomness in computability and set theory
Material type:
TextPublication details: New Jersey : World Scientific Publishing, 2021. Description: xx, 366 pages ; 24 cmISBN: 9789813228221Subject(s): Set theory | Computable functionsDDC classification: 510.22 Online resources: Table of content | Reviews Summary: This volume presents some exciting new developments occurring on the interface between set theory and computability as well as their applications in algebra, analysis and topology. These include effective versions of Borel equivalence, Borel reducibility and Borel determinacy. It also covers algorithmic randomness and dimension, Ramsey sets and Ramsey spaces. Many of these topics are being discussed in the NSF-supported annual Southeastern Logic Symposium.
| Item type | Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
Book
|
NISER LIBRARY | 510.22 CEN-S (Browse shelf(Opens below)) | Available | 25817 |
Includes bibliographical references and index.
This volume presents some exciting new developments occurring on the interface between set theory and computability as well as their applications in algebra, analysis and topology. These include effective versions of Borel equivalence, Borel reducibility and Borel determinacy. It also covers algorithmic randomness and dimension, Ramsey sets and Ramsey spaces. Many of these topics are being discussed in the NSF-supported annual Southeastern Logic Symposium.
Graduate students and researchers interested in the interface between set theory and computability.
There are no comments on this title.