On restricted forms of enumeration reducibility
type: Item
instance of: scholarly article
title: On restricted forms of enumeration reducibility
zbMATH Open document ID: 0751.03021
DOI: 10.1016/0168-0072(90)90051-3
author: Phil Watson
published in: Annals of Pure and Applied Logic
publication date: 1992-06-25T00:00:00Z
review text: \(e\)-reducibility is studied in recursion theory. It was introduced in the early 50's but many questions on the structure of \(e\)-degrees remained open up to now. The author considers relations between \(e\)-degrees and degrees based on restricted forms of \(e\)-reducibility. The old result of S. Zakharov is reproved and a few new results are obtained.
reviewed by: Sh. T. Ishmukhametov
Mathematics Subject Classification ID: 03D30
zbMATH DE Number: 5594
zbMATH Keywords: \(e\)-degrees
zbMATH Keywords: \(e\)-reducibility
MaRDI profile type: Publication
full work available at URL: 0168-0072(90)90051-3
OpenAlex ID: W2082068214
cites work: Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
cites work: Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
cites work: Q4694240
cites work: Reducibility and Completeness for Sets of Integers
cites work: Jumps of quasi-minimal enumeration degrees
cites work: On minimal pairs of enumeration degrees
cites work: Note on Degrees of Partial Functions
cites work: e- and s-degrees
description: scientific article; zbMATH DE number 5594