1 citations · 2 across the 2 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2009★ 1 cited
Polish group actions and computability
Aleksander Ivanov, Barbara Majcher-Iwanow
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…
math.LO2007★ 1 cited
Polish group actions and admissible sets
B. Majcher-Iwanow
We define some coding of Borel sets in admissible sets. Using this we generalize certain results from model theory involving admissible sets to the case of continuous actions of cl…