Minimal \(m\)-powers
type: Item
instance of: scholarly article
title: Minimal \(m\)-powers
zbMATH Open document ID: 0915.03036
DOI: 10.1007/BF02312854
author: E. A. Polyakov
published in: Mathematical Notes
publication date: 1999-06-27T00:00:00Z
review text: A PRF (partial recursive function) \(f\) has minimal \(m\)-power if (1) \(\text{ dom}(f)\) is not recursive; and (2) if \(g\) is a PRF such that \(\text{ dom}(g)\) is not recursive, \(\text{ rang}(f) = \text{ rang}(g)\) and \(g\leq_m f\), then \(f\leq_m g\). This note shows a necessary and sufficent condition for a PRF to have minimal \(m\)-power.
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 03D25
zbMATH DE Number: 1262512
zbMATH Keywords: recursively enumerable sets
zbMATH Keywords: partial recursive function
zbMATH Keywords: \(m\)-power
reviewed by: Xizhong Zheng
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/bf02312854
OpenAlex ID: W4235754957
description: scientific article; zbMATH DE number 1262512