Complexity of the Isomorphism Problem for Computable Free Projective Planes of Finite Rank

被引:1
|
作者
Kogabaev, N. T. [1 ]
机构
[1] Novosibirsk State Univ, Sobolev Inst Math, Novosibirsk, Russia
基金
俄罗斯基础研究基金会;
关键词
computable structure; computable representation; isomorphism problem; projective plane; free projective plane; EMBEDDING PROBLEM; HOMOMORPHISMS;
D O I
10.1134/S0037446618020131
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Studying computable representations of projective planes, we prove that the isomorphism problem in the class of free projective planes of finite rank is an m-complete Delta(0) (3)-set within the class.
引用
收藏
页码:295 / 308
页数:14
相关论文
共 50 条