Computable dimensions of Pappusian and Desarguesian projective planes

DOI10.1007/S10469-012-9169-6zbMATH Open1273.03121OpenAlexW2064284698MaRDI QIDQ694236FDOQ694236

Authors: N. T. Kogabaev 

Publication date: 11 December 2012

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-012-9169-6

Recommendations

• Noncomputability of classes of Pappian and Desarguesian projective planes
• The class of projective planes is noncomputable
• \(\prod_1^1\)-completeness of the computable categoricity problem for projective planes
• Freely generated projective planes with finite computable dimension
• The complexity of the isomorphism problem for computable projective planes

zbMATH Keywords

computable dimensioncomputable modelprojective planeDesarguesian projective planePappian projective plane

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Cites Work

• Computably categorical fields via Fermat's last theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory of projective planes
• Definability and decision problems in arithmetic

Cited In (8)

• The complexity of the isomorphism problem for computable projective planes
• Undecidability of the theory of projective planes
• The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes
• The class of projective planes is noncomputable
• \(\prod_1^1\)-completeness of the computable categoricity problem for projective planes
• On automaton presentations of projective planes
• Freely generated projective planes with finite computable dimension
• Noncomputability of classes of Pappian and Desarguesian projective planes

This page was built for publication: Computable dimensions of Pappusian and Desarguesian projective planes

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