Sciweavers

96 search results - page 1 / 20
» Long Borel hierarchies
Sort
View
MLQ
2008
50views more  MLQ 2008»
13 years 9 months ago
Long Borel hierarchies
We show that there is a model of ZF in which the Borel hierarchy on the reals has length 2. This implies that 1 has countable cofinality, so the axiom of choice fails very badly i...
Arnold W. Miller
ICALP
2004
Springer
14 years 3 months ago
Games with Winning Conditions of High Borel Complexity
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
Olivier Serre
APAL
2010
97views more  APAL 2010»
13 years 10 months ago
Beyond Borel-amenability: Scales and superamenable reducibilities
We analyze the degree-structure induced by large reducibilities under the Axiom of Determinacy. This generalizes the analysis of Borel reducibilities given in [1], [6] and [5] e.g...
L. Motto Ros
JSYML
2006
76views more  JSYML 2006»
13 years 9 months ago
Diagonal actions and Borel equivalence relations
We investigate diagonal actions of Polish groups and the related intersection operator on closed subgroups of the acting group. The Borelness of the diagonal orbit equivalence rela...
Longyun Ding, Su Gao
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 10 months ago
On Omega Context Free Languages which are Borel Sets of Infinite Rank
This paper is a continuation of the study of topological properties of omega context free languages (-CFL). We proved in [Topological Properties of Omega Context Free Languages, T...
Olivier Finkel