\(\Sigma_2\)-constructions and \(\text{I}\Sigma_1\) (Q1295390)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(\Sigma_2\)-constructions and \(\text{I}\Sigma_1\) |
scientific article |
Statements
\(\Sigma_2\)-constructions and \(\text{I}\Sigma_1\) (English)
0 references
23 November 1999
0 references
This paper establishes the provability in I\(\Sigma_1\) of the following embedding result: any recursive partial order with a maximal element can be embedded in the r.e. degrees with the maximal element mapping to any prescribed nonrecursive, incomplete degree. Consequently, statements of a certain form in the language of partial orders are eliminated as possible candidates for statements that can be proved by \(\Sigma_2\) priority arguments but cannot be proved in I\(\Sigma_1\).
0 references
fragments of arithmetic
0 references
priority
0 references
embedding
0 references
recursive partial order
0 references
recursively enumerable degrees
0 references