Hostname: page-component-848d4c4894-pftt2 Total loading time: 0 Render date: 2024-05-28T18:41:00.714Z Has data issue: false hasContentIssue false
  • English
  • Français

Uniform regular enumerations

Published online by Cambridge University Press:  11 October 2006

IVAN SOSKOV  and
BOGOMIL KOVACHEV
IVAN SOSKOV
Affiliation:
Faculty of Mathematics and Computer Science, Sofia University, 5 James Bourchier Blvd., 1164 Sofia, Bulgaria Email: soskov@fmi.uni-sofia.bg
BOGOMIL KOVACHEV
Affiliation:
Faculty of Mathematics and Computer Science, Sofia University, 5 James Bourchier Blvd., 1164 Sofia, Bulgaria Email: soskov@fmi.uni-sofia.bg
Get access Rights & Permissions [Opens in a new window]

Abstract

In the paper we introduce and study the uniform regular enumerations for arbitrary recursive ordinals. As an application of the technique, we obtain a uniform generalisation of a theorem of Ash and a characterisation of a class of uniform operators on transfinite sequences of sets of natural numbers.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 16 , Issue 5 , October 2006 , pp. 901 - 924
Copyright
2006 Cambridge University Press

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.)