Overview

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.

Topics Covered

These include effective versions of Borel equivalence, Borel reducibility and Borel determinacy. It also covers algorithmic randomness and dimension, Ramsey sets and Ramsey spaces.

Additional Information

Many of these topics are being discussed in the NSF-supported annual Southeastern Logic Symposium.