Polish group actions and computability

MaRDI QIDQ6213020zbMATH OpenFDO

Authors A. A. Ivanov, Barbara Majcher-Iwanow

Publication date 5 March 2009

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Descriptive set theory (03E15)

Abstract: Let G be a closed subgroup of the group of all permutations of a countably infinite set. Let X be a Polish G-space with a countable basis A of clopen sets. Each x from X defines a characteristic function f on A by f(U)=1 iff x belongs to U (where U is from A). We consider computable complexity of f and some related questions.

This page was built for publication: Polish group actions and computability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6213020)