Structure and randomness in computability and set theory
Structure and randomness in computability and set theory
- New Jersey : World Scientific Publishing, 2021.
- xx, 366 pages ; 24 cm.
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.
9789813228221
Set theory
Computable functions
510.22 / CEN-S
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.
9789813228221
Set theory
Computable functions
510.22 / CEN-S
