On the problem of definability of the computably enumerable degrees in the difference hierarchy
type: Item
instance of: scholarly article
title: On the problem of definability of the computably enumerable degrees in the difference hierarchy
zbMATH Open document ID: 1477.03161
DOI: 10.1134/S1995080218050037
author: M. M. Yamaleev
author: M. M. Arslanov
published in: Lobachevskii Journal of Mathematics
publication date: 2018-09-27T00:00:00Z
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 03D30
zbMATH DE Number: 6945060
zbMATH Keywords: difference hierarchy
zbMATH Keywords: Turing degrees
zbMATH Keywords: definable relations
zbMATH Keywords: structural properties
MaRDI profile type: Publication
cites work: Nondensity of Double Bubbles in the D.C.E. Degrees
cites work: On Downey's conjecture
cites work: Definable relations in Turing degree structures
cites work: Model-theoretic properties of Turing degrees in the Ershov difference hierarchy
cites work: Turing Definability in the Ershov Hierarchy
cites work: Splitting and cone avoidance in the d.c.e. degrees
cites work: On the r. e. predecessors of d. r. e. degrees
cites work: Differences of Computably Enumerable Sets
cites work: Downward density of exact degrees
cites work: Jump restricted interpolation in the recursively enumerable degrees
cites work: Splitting in 2-computably enumerable degrees with avoiding cones
full work available at URL: s1995080218050037
OpenAlex ID: W2843614064
Wikidata QID: Q129576846
description: scientific article; zbMATH DE number 6945060