|
This article is cited in 1 scientific paper (total in 1 paper)
$m$-Reducibility with Upper and Lower Bounds for the Reducing Functions
V. N. Belyaev, V. K. Bulitko I. I. Mechnikov Odessa National University
Abstract:
We study pairs $(\mathfrak T^1,\mathfrak T^0)$ of classes of nondecreasing total one-place arithmetic functions that specify reflexive and transitive binary relations $\{(A,B)\mid A,B\subseteq N\mathop{\&}(\exists$ g.r.f. $h$) $(\exists f_1\in \mathfrak T^0)[A\le{}_m^hB\mathop{\&}f_0\trianglelefteq h\trianglelefteq f_1]\}$. (Here $k\trianglelefteq l$ means that the function $l$ majorizes the function $k$ almost everywhere.) Criteria for reflexivity and transitivity of such relations are established. Evidence of extensive branching of the arising system of bounded $m$-reducibilities is obtained. We construct examples of such reducibilities that essentially differ from the standard $m$-reducibility in the structure of systems of undecidability degrees that they generate and in the question of completeness of sets.
Received: 07.02.2000
Citation:
V. N. Belyaev, V. K. Bulitko, “$m$-Reducibility with Upper and Lower Bounds for the Reducing Functions”, Mat. Zametki, 70:1 (2001), 12–21; Math. Notes, 70:1 (2001), 11–19
Linking options:
https://www.mathnet.ru/eng/mzm713https://doi.org/10.4213/mzm713 https://www.mathnet.ru/eng/mzm/v70/i1/p12
|
Statistics & downloads: |
Abstract page: | 412 | Full-text PDF : | 182 | References: | 65 | First page: | 1 |
|