Descriptive set theory can provide a suitable framework to investigate complexity in mathematics, most notably in algebra, analysis and topology. Some aspects of Borel reducibility theory for equivalence relations are presented. Examples and open problems are discussed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this paper
Cite this paper
Camerlo, R. (2004). Classification problems in algebra and topology. In: Löwe, B., Piwinger, B., Räsch, T. (eds) Classical and New Paradigms of Computation and their Complexity Hierarchies. Trends in Logic, vol 23. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-2776-5_5
Download citation
DOI: https://doi.org/10.1007/978-1-4020-2776-5_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-2775-8
Online ISBN: 978-1-4020-2776-5
eBook Packages: Springer Book Archive