Title of article :
∑2-constructions and I∑1
Original Research Article
Author/Authors :
Marcia Groszek، نويسنده , , Tamara Hummel، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1998
Abstract :
The consistency strength of the ∑2 (Sacks finite injury) priority method is I∑2, yet classical theorems proven by this method have been proved from I∑1. Is there a statement about the structure of the r.e. degrees that can be proved using a ∑2 argument and cannot be proved from I∑1?
We rule out statements in the language of partial orderings of the form View the MathML source, where ϑ is quantifier-free, by showing that the following can be proved in I∑1.
If P is any recursive partial ordering with a maximal (not necessarily maximum) point d, and a is any nonrecursive incomplete r.e. degree, then P can be embedded into the r.e. degrees by an embedding sending d to a.
Keywords :
Fragments of arithmetic , Priority , Recursion theory , Computability theory
Journal title :
Annals of Pure and Applied Logic
Journal title :
Annals of Pure and Applied Logic