|
This article is cited in 1 scientific paper (total in 1 paper)
Boolean classes of Turing reductions
V. K. Bulitko
Abstract:
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.
Received: 23.11.1982
Citation:
V. K. Bulitko, “Boolean classes of Turing reductions”, Math. USSR-Izv., 26:1 (1986), 1–29
Linking options:
https://www.mathnet.ru/eng/im1345https://doi.org/10.1070/IM1986v026n01ABEH001131 https://www.mathnet.ru/eng/im/v49/i1/p3
|
Statistics & downloads: |
Abstract page: | 203 | Russian version PDF: | 93 | English version PDF: | 18 | References: | 50 | First page: | 1 |
|