MODNET

Research Training Network in Model Theory

Publications > Preprint server > Preprint Number 175
Preprint Number 175
175. Aleksander Ivanov, Barbara Majcher-Iwanow Polish group actions and computability Submission date: 11 March 2009. 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. Mathematics Subject Classification: 03E15; 03D45 Keywords and phrases: |

Last updated: March 23 2021 10:21 | Please send your corrections to: |