Esta web utiliza cookies propias y de terceros que nos permiten optimizar tu experiencia en el sitio web, evaluar su rendimiento, generar estadísticas de uso y mejorar y añadir nuevas funcionalidades. Mediante el análisis de tus hábitos de navegación podemos mostrar contenidos más relevantes y medir las interacciones con la web.
Puede obtener más información aquí.

Avanzado
Artículos
Portada

COMPUTABLE STRUCTURE THEORY IBD

ALEXANDER MELNIKOV / RODNEY G DOWNEY
SPRINGER
09 / 2025
9783031924323
Inglés

Sinopsis

This is the first book which gives a unified theory for countable and uncountable computable structures.The work treats computable linear orderings, graphs, groups and Boolean algebras unified with computable metric and Banach spaces, profinite groups, and the like. Further, it provides the first account of these that exploits effective versions of dualities, such as Stone and Pontryagin dualities. The themes are effective classification and enumeration.Topics and features:·áááááá Delivers a self-contained, gentle introduction to priority arguments, directly applying them in algebraic contexts·áááááá Includes extensive exercises that both cement and amplify the materials·áááááá Provides complete introduction to the basics of computable analysis, particularly in the context of computable structures·áááááá Offers the first monograph treatment of computable Polish groups, effective profinite groups via Stone duality, and effective abelian groups via Pontryagin duality·áááááá Presents the first book treatment of Friedberg enumerations of structuresThis unique volume is aimed at graduate students and researchers in computability theory, as well as mathematicians seeking to understand the algorithmic content of structure theory. Being self-contained, it provides ample opportunity for self-study.