An easy priority-free proof of a theorem of Friedberg
type: Item
instance of: scholarly article
title: An easy priority-free proof of a theorem of Friedberg
zbMATH Open document ID: 0701.03018
DOI: 10.1016/0304-3975(90)90141-4
author: N. E. Zubov
published in: Theoretical Computer Science
publication date: 1990-01-01T00:00:00Z
review text: Using the priority method, \textit{R. M. Friedberg} [J. Symb. Logic 23, 309- 316 (1959; Zbl 0088.016)] proved that the class of all partial recursive unary functions can be enumerated without repetition. We present a new, straightforward proof of this result. The proof can be adapted for a wide variety of other r.e. classes.
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 03D45
zbMATH DE Number: 4148068
zbMATH Keywords: recursively enumerable classes
zbMATH Keywords: partial recursive functions
zbMATH Keywords: numberings
reviewed by: Martin Kummer
MaRDI profile type: Publication
full work available at URL: 0304-3975(90)90141-4
OpenAlex ID: W1995925155
cites work: TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
cites work: Q4723720
cites work: CSL '88. Proceedings. 2nd workshop on computer science logic, Duisburg, Germany, October 3-7, 1988
cites work: Q5573961
cites work: Q3819052
description: scientific article; zbMATH DE number 4148068