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

Research output: Contribution to journalArticlepeer-review

Abstract

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 Δ0 3-set within the class.

Original languageEnglish
Pages (from-to)295-308
Number of pages14
JournalSiberian Mathematical Journal
Volume59
Issue number2
DOIs
Publication statusPublished - 1 Mar 2018

Keywords

  • computable representation
  • computable structure
  • free projective plane
  • isomorphism problem
  • projective plane
  • HOMOMORPHISMS
  • EMBEDDING PROBLEM

Fingerprint

Dive into the research topics of 'Complexity of the Isomorphism Problem for Computable Free Projective Planes of Finite Rank'. Together they form a unique fingerprint.

Cite this