Almost Combinatorial Selector Sets
Matematičeskie zametki, Tome 68 (2000) no. 6, pp. 851-853
Cet article a éte moissonné depuis la source Math-Net.Ru
Classes of subsets of positive integers based on the notion of selector functions similar to the Jockusch selector of a semirecursive set are studied.
@article{MZM_2000_68_6_a4,
author = {A. N. Degtev},
title = {Almost {Combinatorial} {Selector} {Sets}},
journal = {Matemati\v{c}eskie zametki},
pages = {851--853},
year = {2000},
volume = {68},
number = {6},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2000_68_6_a4/}
}
A. N. Degtev. Almost Combinatorial Selector Sets. Matematičeskie zametki, Tome 68 (2000) no. 6, pp. 851-853. http://geodesic.mathdoc.fr/item/MZM_2000_68_6_a4/
[1] Degtev A. N., “Rekursivno-kombinatornye svoistva podmnozhestv naturalnykh chisel”, Algebra i logika, 29:3 (1990), 303–314 | MR | Zbl
[2] Degtev A. N., “Pochti polurekursivnye mnozhestva”, Matem. zametki, 66:2 (1999), 188–193 | MR | Zbl
[3] Jockusch C. G., “Semirecursive sets and positive reducibility”, Trans. Amer. Math. Soc., 131 (1968), 420–436 | DOI | MR | Zbl
[4] Yablonskii S. V., Gavrilov G. P., Kudryavtsev V. G., Funktsiya algebry logiki i klassa Posta, Nauka, M., 1966 | Zbl