Complexity of the isomorphism problem for computable free projective planes of finite rank

DOI10.1134/S0037446618020131OpenAlexW2801423272MaRDI QIDQ721371

N. T. Kogabaev

Publication date: 19 July 2018

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446618020131

zbMATH Keywords

projective planeisomorphism problemcomputable structurecomputable representationfree projective plane

Mathematics Subject Classification ID

General theory of linear incidence geometry and projective geometries (51A05) Computable structure theory, computable model theory (03C57)

Related Items (1)

Computable Scott sentences for quasi-Hopfian finitely presented structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Homomorphisms and algorithmic problems in projective planes
• The computable embedding problem
• The isomorphism problem for classes of computable fields
• Theory of projective planes
• On freely generated projective planes
• Constructively presented projective planes
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Some algorithmic problems for projective planes
• Ternary of a projective plane
• Homomorphisms of projective planes. I
• Functional trees and automorphisms of models
• Computable structures and the hyperarithmetical hierarchy
• Homomorphisms of projective planes. II.
• Undecidable fragments of elementary theories
• The embedding problem for computable projective planes
• The isomorphism problem for computable Abelian _p-groups of bounded length
• Isomorphism relations on computable structures
• Homomorphisms of freely generated projective planes
• Homomorphisms of freely generated projective planes

This page was built for publication: Complexity of the isomorphism problem for computable free projective planes of finite rank