其他名称：
25-21-00228
项目负责人：
Zubkov Maxim
发表日期：
2025
主持机构：
Kazan (Volga region) Federal University, Kazan University, KFU,
国家：
俄罗斯
开始日期：
2025
结束日期：
2026
简介：
The main goal of the project is to develop research into issues of computable representability of linear orders and their connections with the theory of positive and negative equivalence relations. In addition, it is planned to apply the obtained methods and approaches to the study of constructivizations of uncountable structures - computable Polish spaces. Despite the large number of works aimed at studying the algorithmic properties of algebraic structures, a significant number of problems remain open. For example, to describe low linear orders that have a computable representation, to describe the relationship between the computable-theoretic properties of relations on linear orders and the computable-theoretic properties of classes of equivalence relations that realized them. To study uncountable structures, it is planned to construct suitable functors that will allow us to transfer results from the theory of computable linear orders to the theory of computable Polish spaces.
专业领域：
信息技术
语种：
英语
