RUS  ENG
Full version
JOURNALS // Algebra i logika

Algebra Logika, 2005, Volume 44, Number 2, Pages 173–197 (Mi al102)

Classifying Countable Boolean Terms
V. L. Selivanov

References

1. V. L. Selivanov, “Fine hierarchies and Boolean terms”, J. Symb. Log., 60:1 (1995), 289–317  crossref  mathscinet  zmath
2. W. Wadge, “Degrees of complexity of subsets of the Baire space”, Notices Am. Math. Soc., 1972, no. A-714
3. W. Wadge, Reducibility and determinateness in the Baire space, PhD thesis, Univ. California, Berkeley, 1984
4. R. van Wesep, “Wadge degrees and descriptive set theory”, Cabal Semin., Proc. Caltech-UCLA Logic Semin. 1976-77, Lec. Notes Math., 689, 1978, 151–170  mathscinet  zmath
5. J. Steel, “Determinateness and the separation property”, J. Symb. Log., 45:1 (1981), 41–44  crossref  mathscinet
6. Y. N. Moschovakis, Descriptive set theory, North-Holland Publ. Co., Amsterdam, 1980  mathscinet  zmath
7. A. Tang, “Chain properties in $P_{\omega}$”, Theor. Comput. Sci., 9 (1979), 153–172  crossref  mathscinet  zmath
8. V. L. Selivanov, “Raznostnaya ierarkhiya v $\varphi$-prostranstvakh”, Algebra i logika, 43:4 (2004), 425–444  mathnet  mathscinet  zmath
9. L. V. Kantorovich, E. M. Livenson, “Memoir on the analytical operations and projective sets. I”, Fund. Math., 18 (1932), 214–271
10. R. van Wesep, Subsystems of second-order arithmetic, and descriptive set theory under the axiom of determinateness, PhD thesis, Univ. California, Berkeley, 1977
11. L. Staiger, “Hierarchies of recursive $\omega$-languages”, Elektron. Inf. Kybern., 22:5/6 (1986), 219–241  mathscinet  zmath


© Steklov Math. Inst. of RAS, 2025