On definable filters in computably enumerable degrees (Q2370372): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.apal.2007.03.003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1971195245 / rank | |||
Normal rank |
Revision as of 21:28, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On definable filters in computably enumerable degrees |
scientific article |
Statements
On definable filters in computably enumerable degrees (English)
0 references
25 June 2007
0 references
Shore had posed the problem of the existence of (naturally) definable filters in the structure of c.e. degrees, other than the known example of \textbf{NC}, the set of noncappable c.e. degrees. He also posed a parallel question regarding ideals, which Nies subsequently addressed. The present paper adapts Nies' results to show that filters generated by definable sets are themselves definable. In particular, let \({\mathcal F}_1\) denote the filter generated by the set of c.e. degrees that can be cupped to \({\mathbf 0'}\) by a cappable degree, and let \({\mathcal F}_2\) denote the filter generated by the set of Lachlan-Harrington nonsplitting bases. Then \({\mathcal F}_1\) and \({\mathcal F}_2\) are definable. The authors prove that \({\mathcal F}_1\), \({\mathcal F}_2\), and indeed the filter generated by their union are proper subfilters of~\textbf{NC}. They further show that \({\mathcal F}_1\not\subseteq{\mathcal F}_2\), leaving the possibility of \({\mathcal F}_2\subset{\mathcal F}_1\) as an open question.
0 references
computably enumerable degrees
0 references
definable filters
0 references