The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes

DOI10.1134/S0037446618020076OpenAlexW2802533489MaRDI QIDQ721363

A. K. Voĭtov

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/s0037446618020076

zbMATH Keywords

computable modelcomputable class of modelscomputable isomorphismDesarguesian projective planefreely generated projective planepappian 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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Noncomputability of classes of Pappian and Desarguesian projective planes
• The isomorphism problem for classes of computable fields
• Computable numberings of the class of Boolean algebras with distinguished endomorphisms
• A Borel reductibility theory for classes of countable structures
• The isomorphism problem for computable Abelian _p-groups of bounded length
• The class of projective planes is noncomputable
• Computable Algebra, General Theory and Theory of Computable Fields

This page was built for publication: The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes