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.

Abstract

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

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

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183744691

Mathematical Reviews number (MathSciNet)
MR1324514

Zentralblatt MATH identifier
0824.03022

JSTOR
links.jstor.org

Citation

Selivanov, V. L. Fine Hierarchies and Boolean Terms. J. Symbolic Logic 60 (1995), no. 1, 289--317. https://projecteuclid.org/euclid.jsl/1183744691


Export citation