Σ2-collection and the infinite injury priority method
1988 ◽
Vol 53
(1)
◽
pp. 212-221
◽
Keyword(s):
AbstractWe show that the existence of a recursively enumerable set whose Turing degree is neither low nor complete cannot be proven from the basic axioms of first order arithmetic (P−) together with Σ2-collection (BΣ2). In contrast, a high (hence, not low) incomplete recursively enumerable set can be assembled by a standard application of the infinite injury priority method. Similarly, for each n, the existence of an incomplete recursively enumerable set that is neither lown nor highn-1, while true, cannot be established in P− + BΣn+1. Consequently, no bounded fragment of first order arithmetic establishes the facts that the highn and lown jump hierarchies are proper on the recursively enumerable degrees.
Keyword(s):
Keyword(s):
1976 ◽
Vol 41
(3)
◽
pp. 695-696
◽
Keyword(s):