Tabular powers of maximal sets
Matematičeskie zametki, Tome 20 (1976) no. 3, pp. 373-381
Voir la notice de l'article provenant de la source Math-Net.Ru
The following result is established for reducibility of tabular type. Whatever the recursively enumerated nonrecursive incomplete power is, there exists a power, not congruent with it, containing a maximal set.
@article{MZM_1976_20_3_a8,
author = {S. S. Marchenkov},
title = {Tabular powers of maximal sets},
journal = {Matemati\v{c}eskie zametki},
pages = {373--381},
publisher = {mathdoc},
volume = {20},
number = {3},
year = {1976},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_1976_20_3_a8/}
}
S. S. Marchenkov. Tabular powers of maximal sets. Matematičeskie zametki, Tome 20 (1976) no. 3, pp. 373-381. http://geodesic.mathdoc.fr/item/MZM_1976_20_3_a8/