There is no plus-capping degree (Q1325049): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Rodney G. Downey / rank | |||
Property / reviewed by | |||
Property / reviewed by: Q1312970 / rank | |||
Property / author | |||
Property / author: Rodney G. Downey / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Lei Quian / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimal pairs in initial segments of the recursively enumerable degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arithmetization of metamathematics in a general setting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On certain lattices of degrees of interpretability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Non-bounding constructions / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01352932 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2025603984 / rank | |||
Normal rank |
Latest revision as of 10:03, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | There is no plus-capping degree |
scientific article |
Statements
There is no plus-capping degree (English)
0 references
7 July 1994
0 references
The authors answer a question of Per Lindström. It is proved that there is no ``plus-capping'' degree, i.e. that for any incomplete r.e. degree \({\mathbf w}\), there is an incomplete r.e. degree \({\mathbf a}> {\mathbf w}\) such that there is no r.e. degree \({\mathbf v}> {\mathbf w}\) with \({\mathbf a}\cap {\mathbf v}= {\mathbf w}\).
0 references
plus-capping degrees
0 references
recursively enumerable degree
0 references