Structure and randomness in computability and set theory
Material type:
Item type | Current library | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|
![]() |
NISER LIBRARY | 510.22 CEN-S (Browse shelf(Opens below)) | Available | 25817 |
Browsing NISER LIBRARY shelves Close shelf browser (Hides shelf browser)
510.21 PUD-L Logical foundations of mathematics and computational complexity : | 510.22 BOU-E Theory of sets | 510.22 BOU-E Theory of sets | 510.22 CEN-S Structure and randomness in computability and set theory | 510.22 DAV-S Singular sets of minimizers for the mumford-shah functional | 510.22 DEV-J Joy of Sets: fundamentals of contemporary theory | 510.22 HRB-I Introduction to set theory |
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.