Polish group actions and computability

Details Polish group actions and computability Polish group actions and computability

2009-03-05

arxiv.org/abs/0903.1070v2

Mathematics

Logic

AMS LaTeX file, Section 2.2 is corrected, there are some minor changes in other places

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Polish group actions and computability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polish group actions and computability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polish group actions and computability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-115860