Nonexistence of Minimal Pairs in $$L[{\mathbf d}]$$

DOI10.1007/978-3-319-20028-6_18zbMath1461.03030OpenAlexW1198167222MaRDI QIDQ3195694

Chengling Fang, Jiang Liu, Guohua Wu, M. M. Yamaleev

Publication date: 20 October 2015

Published in: Evolving Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20028-6_18

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Related Items (2)

Elementary theories and structural properties of d-c.e. and n-c.e. degrees ⋮ Turing computability: structural theory

Cites Work

• On a problem of Ishmukhametov
• On the r. e. predecessors of d. r. e. degrees
• On relative enumerability of Turing degrees
• Unnamed Item

This page was built for publication: Nonexistence of Minimal Pairs in $$L[{\mathbf d}]$$