Enumerations of Turing ideals with applications (Q2277253)
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: Enumerations of Turing ideals with applications |
scientific article; zbMATH DE number 4195926
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerations of Turing ideals with applications |
scientific article; zbMATH DE number 4195926 |
Statements
Enumerations of Turing ideals with applications (English)
0 references
1990
0 references
A Turing ideal is a collection of sets of integers closed under Turing reducibility and join. The author studies enumerations of such objects with an eye to applications in the model theory of first and second order arithmetical systems such as \(WKL_ 0\) and \(RCA_ 0\). The techniques are Cohen and Sacks forcing, and coding techniques such as those of \textit{J. Harrison} [Thesis, Stanford 1966].
0 references
Turing ideal
0 references
Turing reducibility
0 references
enumerations
0 references
model theory of first and second order arithmetical systems
0 references
0.7534943222999573
0 references
0.7513436079025269
0 references
0.7467681765556335
0 references
0.7148030996322632
0 references
