We consider some nonprincipal filters of the Medvedev lattice. We prove that the filter generated by the nonzero closed degrees of difficulty is not principal and we compare this filter, with respect to inclusion, with some other filters of the lattice. All the filters considered in this paper are disjoint from the prime ideal generated by the dense degrees of difficulty.Mathematics Subject Classification: 03D30.

We consider two categories with one object, namely the set of all partial functions of one variable from the set of natural numbers into itself; the morphisms are the partial recursive operators in one case, and certain continuous partial mappings in the other case. We show that these categories are recursion categories and we characterize the domains and the complete domains. Some observations are made on a notion of reducibility obtained by using the total morphisms of these categories, and, subsequently, the general recursive operators. MSC: 03D65, 03D45, 18B20

We show that every nonzero $\Delta^0_2$ enumeration degree bounds a set $1$-generic degree