Turing reducibility in the fine hierarchy

, &
Annals of Pure and Applied Logic 171 (7):102766 (2020)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2019.102766

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

External links

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

Through your library

My notes

Similar books and articles

Π 1 0 classes, L R degrees and Turing degrees.George Barmpalias, Andrew E. M. Lewis & Frank Stephan - 2008 - Annals of Pure and Applied Logic 156 (1):21-38.
Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Countable algebra and set existence axioms. Annals of pure and applied logic, vol. 25 , pp. 141–181. - Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Addendum to “Countable algebra and set existence axioms.” Annals of pure and applied logic, vol. 28 , pp. 319–320. [REVIEW]Peter G. Clote - 1987 - Journal of Symbolic Logic 52 (1):276-278.
Inner model operators in L.Mitch Rudominer - 2000 - Annals of Pure and Applied Logic 101 (2-3):147-184.
Bounds in the Turing reducibility of functions.Karol Habart & K. Habart - 1992 - Mathematical Logic Quarterly 38 (1):423-430.
The life and work of Victor L. Selivanov.Dieter Spreen - 2014 - In Dieter Spreen, Hannes Diener & Vasco Brattka, Logic, Computation, Hierarchies. De Gruyter. pp. 1-8.
Generics for computable Mathias forcing.Peter A. Cholak, Damir D. Dzhafarov, Jeffry L. Hirst & Theodore A. Slaman - 2014 - Annals of Pure and Applied Logic 165 (9):1418-1428.
On restricted forms of enumeration reducibility.Phil Watson - 1990 - Annals of Pure and Applied Logic 49 (1):75-96.
Addendum to “computably enumerable sets and quasi-reducibility”.R. Downey, G. LaForte & A. Nies - 1999 - Annals of Pure and Applied Logic 98 (1-3):295.
The existence of high nonbounding degrees in the difference hierarchy.Chi Tat Chong, Angsheng Li & Yue Yang - 2006 - Annals of Pure and Applied Logic 138 (1):31-51.
Computably enumerable sets and quasi-reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.

Analytics

Added to PP
2019-12-14

Downloads
26 (#892,543)

6 months
3 (#1,061,821)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The veblen functions for computability theorists.Alberto Marcone & Antonio Montalbán - 2011 - Journal of Symbolic Logic 76 (2):575 - 602.
A Hierarchy of Computably Enumerable Degrees.Rod Downey & Noam Greenberg - 2018 - Bulletin of Symbolic Logic 24 (1):53-89.
Fine hierarchies and Boolean terms.V. L. Selivanov - 1995 - Journal of Symbolic Logic 60 (1):289-317.

View all 7 references / Add more references