The class of projective planes is noncomputable

• Autores: N. T. Kogabaev
• Localización: Algebra and logic, ISSN 0002-5232, Vol. 47, Nº. 4, 2008, págs. 242-257
• Idioma: inglés
• DOI: 10.1007/s10469-008-9015-z
• Texto completo no disponible (Saber más ...)
• Resumen

  • Computable projective planes are investigated. It is stated that a free projective plane of countable rank in some inessential expansion is unbounded. This implies that such a plane has infinite computable dimension. The class of all computable projective planes is proved to be noncomputable (up to computable isomorphism).