COMPUTABLE POLISH GROUP ACTIONS

DOI10.1017/jsl.2017.68MaRDI QIDQ4579801

Alexander G. Melnikov, Antonio Montalbán

Publication date: 10 August 2018

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0ca24649912c96a73047509f513f189da779632a

zbMATH Keywords

descriptive set theory; computable analysis; computable algebra; topological group actions

Mathematics Subject Classification ID

03D99: Computability and recursion theory

03C57: Computable structure theory, computable model theory

03D45: Theory of numerations, effectively presented structures

Related Items

Computable topological groups and Pontryagin duality, Effectively closed subgroups of the infinite symmetric group, ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE, ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES, COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM, Computable Stone spaces, Separating notions in effective topology, COMPUTABLY COMPACT METRIC SPACES, Computable topological abelian groups, Computable analysis and classification problems, Effectively Existentially-Atomic Structures

Cites Work

• Effective choice for relations and reducibilities in classes of constructive and positive models
• Transformation groups and \(C^ *\)-algebras
• A robuster Scott rank
• An interpolation theorem for denumerably long formulas
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item