Q4723718
type: Item
instance of: scholarly article
zbMATH Open document ID: 0615.03030
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D25
zbMATH DE Number: 3995654
zbMATH Keywords: recursively enumerable Turing degrees
zbMATH Keywords: degrees of unsolvability
zbMATH Keywords: almost fixed points
zbMATH Keywords: completeness
zbMATH Keywords: families of r.e. sets
author: M. M. Arslanov
MaRDI profile type: Publication
Recommended article: Q3792671
Recommended article: Q3325708
Recommended article: Almost computably enumerable families of sets
Recommended article: Enumeration Degrees and Enumerability of Familes
Recommended article: A hierarchy of families of recursively enumerable degrees
Recommended article: Computable numberings of families of infinite sets
Recommended article: Q3826537
Recommended article: Q3220577
Recommended article: The semilattice of computable families of recursively enumerable sets
Recommended article: Q3982914
description: scientific article; zbMATH DE number 3995654