Ayuda
Ir al contenido

Dialnet


Resumen de The class of projective planes is noncomputable

N. T. Kogabaev

  • 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).


Fundación Dialnet

Dialnet Plus

  • Más información sobre Dialnet Plus