Аннотация:
Устанавливаются некоторые результаты о борелевской и разностной иерархиях подмножеств φ-пространств. Например, доказываются аналоги теорем Ф. Хаусдорфа (о связи разностной и борелевской иерархий) теоремы М. А. Лаврентьева (о том, что разностная иерархия не обрывается).
Образец цитирования:
В. Л. Селиванов, “Разностная иерархия в φ-пространствах”, Алгебра и логика, 43:4 (2004), 425–444; Algebra and Logic, 43:3 (2004), 238–248
Victor Selivanov, “Descriptive complexity of qcb0-spaces”, Theoretical Computer Science, 945 (2023), 113666
Klaus Ambos-Spies, Wolfgang Merkle, Sebastiaan A. Terwijn, “Normalized information distance and the oscillation hierarchy”, Journal of Computer and System Sciences, 124 (2022), 65
de Brecht M., Pauly A., Schroeder M., “Overt Choice”, Computability, 9:3-4 (2020), 169–191
Callard A., Hoyrup M., “Descriptive Complexity on Non-Polish Spaces”, Leibniz International Proceedings in Informatics, 154, eds. Paul C., Blaser M., Schloss Dagstuhl, Leibniz Center Informatics, 2020, 8
Camerlo R., “Continuous Reducibility: Functions Versus Relations”, Rep. Math. Log., 54 (2019), 45–63
Selivanov V., “Towards a Descriptive Theory of Cb(0)-Spaces”, Math. Struct. Comput. Sci., 27:8 (2017), 1553–1580
Ros L.M., Schlicht Ph., Selivanov V., “Wadge-Like Reducibilities on Arbitrary Quasi-Polish Spaces”, Math. Struct. Comput. Sci., 25:8, SI (2015), 1705–1754
Schroeder M., Selivanov V., “Some Hierarchies of Qcb(0)-Spaces”, Math. Struct. Comput. Sci., 25:8, SI (2015), 1799–1823
Pauly A., de Brecht M., “Descriptive Set Theory in the Category of Represented Spaces”, 2015 30Th Annual Acm/IEEE Symposium on Logic in Computer Science (Lics), IEEE Symposium on Logic in Computer Science, IEEE, 2015, 438–449
Spreen D., “the Life and Work of Victor l. Selivanov”, Logic, Computation, Hierarchies, Ontos Mathematical Logic, 4, ed. Brattka V. Diener H. Spreen D., Walter de Gruyter Gmbh, 2014, 1–8
de Brecht M., “Levels of Discontinuity, Limit-Computability, and Jump Operators”, Logic, Computation, Hierarchies, Ontos Mathematical Logic, 4, eds. Brattka V., Diener H., Spreen D., Walter de Gruyter Gmbh, 2014, 79–107
Stéphane Le Roux, Arno Pauly, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014, 1
de Brecht M., “Quasi-Polish Spaces”, Ann. Pure Appl. Log., 164:3 (2013), 356–381
Selivanov V.L., “Towards a descriptive set theory for domain-like structures”, Theoret. Comput. Sci., 365:3 (2006), 258–282
Michael Huth, “Topological Analysis of Refinement”, Electronic Notes in Theoretical Computer Science, 161 (2006), 3
В. Л. Селиванов, “О классификации счётных булевых термов”, Алгебра и логика, 44:2 (2005), 173–197; V. L. Selivanov, “Classifying Countable Boolean Terms”, Algebra and Logic, 44:2 (2005), 95–108
В. Л. Селиванов, “Вариации на тему сводимости Вэджа”, Матем. тр., 8:1 (2005), 135–175; V. L. Selivanov, “Variations on the Wadge Reducibility”, Siberian Adv. Math., 15:3 (2005), 44–80