Boolean classes of Turing reductions
Izvestiya. Mathematics , Tome 26 (1986) no. 1, pp. 1-29
Voir la notice de l'article provenant de la source Math-Net.Ru
A relation of sub-Turing reducibility is defined for each class of ordered pairs of Boolean functions. Criteria are found for the transitivity and reflexivity of the reducibility relation defined by a class of ordered pairs of Boolean functions. The place of a number of familiar reducibilities in the framework of this classification is indicated.
Bibliography: 10 titles.
@article{IM2_1986_26_1_a0,
author = {V. K. Bulitko},
title = {Boolean classes of {Turing} reductions},
journal = {Izvestiya. Mathematics },
pages = {1--29},
publisher = {mathdoc},
volume = {26},
number = {1},
year = {1986},
language = {en},
url = {http://geodesic.mathdoc.fr/item/IM2_1986_26_1_a0/}
}
V. K. Bulitko. Boolean classes of Turing reductions. Izvestiya. Mathematics , Tome 26 (1986) no. 1, pp. 1-29. http://geodesic.mathdoc.fr/item/IM2_1986_26_1_a0/