\(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator (Q1368581)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator |
scientific article; zbMATH DE number 1067505
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator |
scientific article; zbMATH DE number 1067505 |
Statements
\(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator (English)
0 references
26 January 1998
0 references
The authors consider models of the base theory \(PA^-\) that satisfy \(\Sigma_2\)-collection but not \(\Sigma_2\)-induction. They have shown elsewhere that such a model can contain no incomplete high r.e. degree. In this paper they prove that every such model must satisfy one of the following two conditions and that each condition is satisfied by some model: (a) all incomplete r.e. degrees are low; (b) there are exactly three degrees that are jumps of r.e. degrees. The proof proceeds by blocking for \(\Pi_2\) cuts.
0 references
recursively enumerable degree
0 references
jump operator
0 references
tame relation
0 references
\(\Sigma_ 2\)-induction
0 references
\(\Sigma_ 2\)-collection
0 references
blocking
0 references
0 references