论文信息 - Wadge Degrees of [omega]-Languages of Deterministic Turing Machines

Wadge Degrees of [omega]-Languages of Deterministic Turing Machines

We describe Wadge degrees of ω -languages recognizable by deterministic Turing machines. In particular, it is shown that the ordinal corresponding to these degrees is ξ ω where ξ = ω 1 CK is the first non-recursive ordinal known as the Church–Kleene ordinal. This answers a question raised in [2].

Victor L. Selivanov

[1] Klaus W. Wagner,et al. On omega-Regular Sets , 1979, Inf. Control..

[2] Victor L. Selivanov,et al. Wadge degrees of ω-languages of deterministic Turing machines , 2003 .

[3] V. L. Selivanov. Hierearchies of hyperarithmetical sets and functions , 1983 .

[4] Victor L. Selivanov,et al. Wadge Degrees of omega-Languages of Deterministic Turing Machines , 2003, STACS.

[5] Victor L. Selivanov,et al. Fine hierarchies and Boolean terms , 1995, Journal of Symbolic Logic.

[6] John R. Steel,et al. Determinateness and the separation property , 1981, Journal of Symbolic Logic.

[7] Y. Ershov. On a hierarchy of sets, II , 1968 .

[8] A. Louveau,et al. Some results in the wadge hierarchy of borel sets , 1983 .

[9] Victor Selivanov,et al. Fine Hierarchy of Regular Omega-Languages , 1995, Theor. Comput. Sci..

[10] Jacques Duparc,et al. A hierarchy of deterministic context-free omega-languages , 2003, Theor. Comput. Sci..

[11] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[12] Robert van Wesep,et al. Wadge Degrees and Projective Ordinals: The Cabal Seminar, Volume II: Wadge degrees and descriptive set theory , 1978 .

[13] Y. Moschovakis. Descriptive Set Theory , 1980 .