Journal of Symbolic Logic 60 (1):289-317 (1995)

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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275522
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 61,008
Through your library

References found in this work BETA

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Set Theory.H. B. Enderton - 1975 - Journal of Symbolic Logic 40 (4):629-630.
The Method of Alternating Chains.J. W. Addison - 1965 - In The Theory of Models. Amsterdam: North-Holland Pub. Co.. pp. 1--16.
Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.

Add more references

Citations of this work BETA

Fine Hierarchies Via Priestley Duality.Victor Selivanov - 2012 - Annals of Pure and Applied Logic 163 (8):1075-1107.

Add more citations

Similar books and articles


Added to PP index

Total views
165 ( #61,929 of 2,439,449 )

Recent downloads (6 months)
12 ( #54,856 of 2,439,449 )

How can I increase my downloads?


My notes