Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-19T00:13:28.931Z Has data issue: false hasContentIssue false

On recursive enumerability with finite repetitions

Published online by Cambridge University Press:  12 March 2014

Stephan Wehner*
Affiliation:
Department of Chemistry, University of British Columbia, Vancouver, British Columbia, V6T 1Z1, Canada E-mail: stephan@pepe.chem.ubc.ca

Abstract

It is an open problem within the study of recursively enumerable classes of recursively enumerable sets to characterize those recursively enumerable classes which can be recursively enumerated without repetitions. This paper is concerned with a weaker property of r.e. classes, namely that of being recursively enumerable with at most finite repetitions.

This property is shown to behave more naturally: First we prove an extension theorem for classes satisfying this property. Then the analogous theorem for the property of recursively enumerable classes of being recursively enumerable with a bounded number of repetitions is shown not to hold. The index set of the property of recursively enumerable classes “having an enumeration with finite repetitions” is shown to be -complete.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable