Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization

Fil: Becher, Veronica Andrea. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Consejo Nacional de Investigaciones Cientificas y Tecnicas; Argentina

[1]  Y. Ershov.  On a hierarchy of sets, II , 1968 .

[2]  Fred Galvin,et al.  Stationary strategies in topological games , 1986 .

[3]  Verónica Becher,et al.  Wadge hardness in Scott spaces and its effectivization , 2015, Math. Struct. Comput. Sci..

[4]  Hans-Peter A. Künzi,et al.  On strongly quasi-metrizable spaces , 1983 .

[5]  Victor L. Selivanov,et al.  Wadge degrees of ω-languages of deterministic Turing machines , 2003 .

[6]  Victor L. Selivanov,et al.  Towards a descriptive set theory for domain-like structures , 2006, Theor. Comput. Sci..

[7]  K. Kuratowski.  Topology - Volume I , 1966 .

[8]  Kaladhar Voruganti,et al.  Volume I , 2005, Proceedings of the Ninth International Conference on Computer Supported Cooperative Work in Design, 2005..

[9]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[10]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[11]  John C. Oxtoby.  7. THE BANACH-MAZUR GAME AND BANACH CATEGORY THEOREM , 1958 .

[12]  Wolfgang M. Schmidt,et al.  ON BADLY APPROXIMABLE NUMBERS AND CERTAIN GAMES , 1966 .

[13]  Abbas Edalat,et al.  Domains for Computation in Mathematics, Physics and Exact Real Arithmetic , 1997, Bulletin of Symbolic Logic.

[14]  K. Hofmann,et al.  Continuous Lattices and Domains , 2003 .

[15]  Benjamin Naumann,et al.  Classical Descriptive Set Theory , 2016 .

[16]  Peter Hertling,et al.  Unstetigkeitsgrade von Funktionen in der effektiven Analysis , 1996 .

[17]  Victor L. Selivanov,et al.  Hierarchies in φ‐spaces and applications , 2005, Math. Log. Q..

[18]  Yu. L. Ershov,et al.  On a hierarchy of sets. III , 1968 .

[19]  Victor L. Selivanov.  Wadge Degrees of [omega]-Languages of Deterministic Turing Machines , 2003, RAIRO Theor. Informatics Appl..

[20]  Patrick Dehornoy,et al.  Turing Complexity of the Ordinals , 1986, Inf. Process. Lett..

[21]  A. Tang,et al.  Wadge reducibility and Hausdorff difference hierarchy in Pω , 1981 .

[22]  Clifford Spector,et al.  Recursive well-orderings , 1955, Journal of Symbolic Logic.

[23]  Matthew de Brecht.  Quasi-Polish spaces , 2011, Ann. Pure Appl. Log..

[24]  Victor L. Selivanov,et al.  On the Difference Hierarchy in Countably Based T0-Spaces , 2008, CCA.

[25]  Peter Hertling,et al.  Topological Complexity with Continuous Operations , 1996, J. Complex..

[26]  Victor L. Selivanov,et al.  Wadge Degrees of omega-Languages of Deterministic Turing Machines , 2003, STACS.

[27]  Gabriel Debs,et al.  Stratégies gagnantes dans certains jeux topologiques , 1985 .

[28]  Serge Grigorieff,et al.  Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n)) , 1990, Journal of Symbolic Logic.

[29]  Carl Mummert,et al.  Stationary and convergent strategies in Choquet games , 2010 .