|
This article is cited in 5 scientific papers (total in 5 papers)
The class of projective planes is noncomputable
N. T. Kogabaev Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Abstract:
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).
Keywords:
computable projective plane, free projective plane, computable class of structures, computable dimension of structure.
Received: 29.10.2007
Citation:
N. T. Kogabaev, “The class of projective planes is noncomputable”, Algebra Logika, 47:4 (2008), 428–455; Algebra and Logic, 47:4 (2008), 242–257
Linking options:
https://www.mathnet.ru/eng/al366 https://www.mathnet.ru/eng/al/v47/i4/p428
|
Statistics & downloads: |
Abstract page: | 441 | Full-text PDF : | 107 | References: | 76 | First page: | 7 |
|