This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
We compute here the Borel complexity of the relation of isometry between separable Banach spaces, using results of Gao, Kechris [1] and Mayer-Wolf [4]. We show that this relation ...
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 ...