CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
On a problem of Ishmukhametov
Authors
Fang C.
Wu G.
Yamaleev M.
Publication date
1 January 2013
Publisher
Doi
Cite
Abstract
Given a d.c.e. degree d, consider the d.c.e. sets in d and the corresponding degrees of their Lachlan sets. Ishmukhametov provided a systematic investigation of such degrees, and proved that for a given d.c.e. degree d > 0, the class of its c.e. predecessors in which d is c.e., denoted as R[d], can consist of either just one element, or an interval of c.e. degrees. After this, Ishmukhametov asked whether there exists a d.c.e. degree d for which the class R[d] has no minimal element. We give a positive answer to this question. © 2013 Springer-Verlag Berlin Heidelberg
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Digital Repository - Nanyang Technological University
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dr.ntu.edu.sg:10356/103046
Last time updated on 16/04/2020
Kazan Federal University Digital Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dspace.kpfu.ru:net/96799
Last time updated on 07/05/2019
Kazan Federal University Digital Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dspace.kpfu.ru:net/137290
Last time updated on 07/05/2019
DR-NTU (Digital Repository of NTU)
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dr.ntu.edu.sg:10356/103046
Last time updated on 02/08/2023