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

DOI10.1134/S0037446618020131MaRDI QIDQ721371zbMATH OpenOpenAlexFDO

Authors 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

isomorphism problemprojective planecomputable 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)

Cites work

• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 2047478 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• scientific article; zbMATH DE number 3421490 (Why is no real title available?)
• Computable structures and the hyperarithmetical hierarchy
• Constructively presented projective planes
• Functional trees and automorphisms of models
• Homomorphisms and algorithmic problems in projective planes
• Homomorphisms of freely generated projective planes
• Homomorphisms of freely generated projective planes
• Homomorphisms of projective planes. I
• Homomorphisms of projective planes. II.
• Isomorphism relations on computable structures
• On freely generated projective planes
• Some algorithmic problems for projective planes
• Ternary of a projective plane
• The computable embedding problem
• The embedding problem for computable projective planes
• The isomorphism problem for classes of computable fields
• The isomorphism problem for computable Abelian _p-groups of bounded length
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Theory of projective planes
• Undecidable fragments of elementary theories

Cited in

(3)

• scientific article; zbMATH DE number 4161543 (Why is no real title available?)
• Computable Scott sentences for quasi-Hopfian finitely presented structures
• The isometry degree of a computable copy of ℓ p 1

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721371)