There is no plus-capping degree
type: Item
instance of: scholarly article
title: There is no plus-capping degree
zbMATH Open document ID: 0806.03031
DOI: 10.1007/BF01352932
author: Steffen Lempp
author: Rodney G. Downey
published in: Archive for Mathematical Logic
publication date: 1994-07-07T00:00:00Z
review text: 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}\).
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 03D30
zbMATH DE Number: 579321
zbMATH Keywords: plus-capping degrees
zbMATH Keywords: recursively enumerable degree
reviewed by: Lei Qian
MaRDI profile type: Publication
cites work: Minimal pairs in initial segments of the recursively enumerable degrees
cites work: Arithmetization of metamathematics in a general setting
cites work: On certain lattices of degrees of interpretability
cites work: Non-bounding constructions
full work available at URL: https://doi.org/10.1007/bf01352932
OpenAlex ID: W2025603984
description: scientific article; zbMATH DE number 579321