COMPUTABLE POLISH GROUP ACTIONS

DOI10.1017/jsl.2017.68OpenAlexW2887698349MaRDI 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 theorycomputable analysiscomputable algebratopological group actions

Mathematics Subject Classification ID

Computability and recursion theory (03D99) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items

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

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