The class of projective planes is noncomputable

DOI10.1007/S10469-008-9015-ZzbMath1164.03330OpenAlexW2052618204MaRDI QIDQ3546127

N. T. Kogabaev

Publication date: 18 December 2008

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

Full work available at URL: https://doi.org/10.1007/s10469-008-9015-z

zbMATH Keywords

free projective planecomputable class of structurescomputable dimension of structurecomputable projective plane

Mathematics Subject Classification ID

Configuration theorems in linear incidence geometry (51A20) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (5)

Noncomputability of classes of Pappian and Desarguesian projective planes ⋮ Freely generated projective planes with finite computable dimension ⋮ The branching theorem and computable categoricity in the Ershov hierarchy ⋮ Computable numberings of the class of Boolean algebras with distinguished endomorphisms ⋮ The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes

This page was built for publication: The class of projective planes is noncomputable