Bounded Recursively Enumerable Sets and Degrees

A new reducibility between the recursive sets is defined,which is appropriate to be used in the study of the polynomial reducibility and the NP-problem.

Infimum Properties Differ in the Weak Truth-table Degrees and the Turing Degrees

We prove that there are non-recursive r.e.sets A and C with A<T C such that for every set F(?)T A,C∩F≡w(?).