Weak reducibility of computable and generalized computable numberings
type: Item
instance of: scholarly article
title: Weak reducibility of computable and generalized computable numberings
author: Zlata Konstantinovna Ivanova
author: Marat Kh. Faizrahmanov
publication date: 2021-06-17T00:00:00Z
Mathematics Subject Classification ID: 03D45
zbMATH DE Number: 7360153
zbMATH Keywords: computable numbering
zbMATH Keywords: \(w\)-reducibility
zbMATH Keywords: \(A\)-computable numbering
zbMATH Keywords: Rogers semilattice
MaRDI profile type: Publication
full work available at URL: semi.2021.18.035
OpenAlex ID: W3201150822
cites work: Q5476772
cites work: Generalized computable numerations and nontrivial Rogers semilattices
cites work: Generalized computable universal numberings
cites work: Local structure of Rogers semilattices of Σn 0-computable numberings
cites work: Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
cites work: Khutoretskii's theorem for generalized computable families
cites work: Turing Computability
cites work: Universal generalized computable numberings and hyperimmunity
cites work: The degrees of bi‐immune sets
cites work: Positive enumerations
cites work: Minimal generalized computable enumerations and high degrees
DOI: 10.33048/SEMI.2021.18.035
published in: Sibirskie Elektronnye Matematicheskie Izvestiya
description: scientific article; zbMATH DE number 7360153