On \(sQ\)-completeness of recursively enumerable sets
type: Item
instance of: scholarly article
title: On \(sQ\)-completeness of recursively enumerable sets
zbMATH Open document ID: 0787.03031
DOI: 10.1007/BF01209615
published in: Mathematical Notes
publication date: 1994-04-12T00:00:00Z
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 03D30
zbMATH DE Number: 525716
zbMATH Keywords: \(sQ\)-reducibility
zbMATH Keywords: \(sQ_ 1\)-reducibility
zbMATH Keywords: recursively enumerable sets
author: Roland Sh. Omanadze
MaRDI profile type: Publication
cites work: Creative sets
cites work: Reducibility and Completeness for Sets of Integers
cites work: On subcreative sets and S-reducibility
cites work: On a Class of Complete Simple Sets
description: scientific article; zbMATH DE number 525716