Journal of Symbolic Logic

Fine Hierarchies and Boolean Terms

V. L. Selivanov

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.


We consider fine hierarchies in recursion theory, descriptive set theory, logic and complexity theory. The main results state that the sets of values of different Boolean terms coincide with the levels of suitable fine hierarchies. This gives new short descriptions of these hierarchies and shows that collections of sets of values of Boolean terms are almost well ordered by inclusion. For the sake of completeness we mention also some earlier results demonstrating the usefulness of fine hierarchies.

Article information

J. Symbolic Logic, Volume 60, Issue 1 (1995), 289-317.

First available in Project Euclid: 6 July 2007

Permanent link to this document

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier



Selivanov, V. L. Fine Hierarchies and Boolean Terms. J. Symbolic Logic 60 (1995), no. 1, 289--317.

Export citation