Boolean classes of Turing reductions

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.