Yoshindo Suzuki
Abstract
It is known [1] p. 312 that a simultaneous enumeration of the recursively enumerable sets can be achieved by a Σ10-predicate. We shall show that a simultaneous enumeration of the recursive sets can be achieved by a predicate of the same form.
OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is known [1] p. 312 that a simultaneous enumeration of the recursively enumerable sets can be achieved by a Σ10-predicate. We shall show that a simultaneous enumeration of the recursive sets can be achieved by a predicate of the same form.
Key concepts: Enumeration, Recursively enumerable language, Predicate (mathematical logic), Maximal set, Mathematics, Discrete mathematics, Computer science, Combinatorics