论文信息 - 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 ? = ?1CK is the first non-recursive ordinal known as the Church-Kleene ordinal. This answers a question raised in [Du0?].

Victor L. Selivanov | V. Selivanov

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

[2] Victor L. Selivanov. Fine Hierarchy of Regular omega-Languages , 1995, TAPSOFT.

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

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

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

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

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

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

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

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

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

[12] Klaus W. Wagner,et al. The Difference and Truth-Table Hierarchies for NP , 1987, RAIRO Theor. Informatics Appl..

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