Complexity of the isomorphism problem for computable free projective planes of finite rank
DOI10.1134/S0037446618020131OpenAlexW2801423272MaRDI QIDQ721371FDOQ721371
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
isomorphism problemprojective planecomputable structurecomputable representationfree projective plane
General theory of linear incidence geometry and projective geometries (51A05) Computable structure theory, computable model theory (03C57)
Cites Work
- Title not available (Why is that?)
- Computable structures and the hyperarithmetical hierarchy
- The isomorphism problem for computable Abelian p-groups of bounded length
- Title not available (Why is that?)
- Title not available (Why is that?)
- Isomorphism relations on computable structures
- Title not available (Why is that?)
- Theory of projective planes
- The isomorphism problem for torsion-free abelian groups is analytic complete
- Homomorphisms of freely generated projective planes
- On freely generated projective planes
- Functional trees and automorphisms of models
- Homomorphisms of freely generated projective planes
- Homomorphisms and algorithmic problems in projective planes
- Undecidable fragments of elementary theories
- The computable embedding problem
- The isomorphism problem for classes of computable fields
- Some algorithmic problems for projective planes
- Ternary of a projective plane
- Homomorphisms of projective planes. I
- Homomorphisms of projective planes. II.
- The embedding problem for computable projective planes
- Constructively presented projective planes
Cited In (3)
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)
