Fine hierarchies and Boolean terms

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

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

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,804

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Hierarchies in φ‐spaces and applications.Victor L. Selivanov - 2005 - Mathematical Logic Quarterly 51 (1):45-61.
Fine hierarchies via Priestley duality.Victor Selivanov - 2012 - Annals of Pure and Applied Logic 163 (8):1075-1107.
Hierarchies of Effective Descriptive Set Theory.Peter G. Hinman - 1972 - Journal of Symbolic Logic 37 (4):758-759.
Boolean algebras of regular quasi-aperiodic languages.Anton Konovalov - 2014 - In Dieter Spreen, Hannes Diener & Vasco Brattka, Logic, Computation, Hierarchies. De Gruyter. pp. 191-204.
Abstract complexity theory and the Δ20 degrees.Benjamin Schaeffer - 2002 - Annals of Pure and Applied Logic 115 (1-3):195-231.

Analytics

Added to PP
2009-01-28

Downloads
208 (#126,916)

6 months
15 (#213,214)

Historical graph of downloads
How can I increase my downloads?