Intrinsic Reducibilities

Mathematical Logic Quarterly 46 (3):393-407 (2000)
  Copy   BIBTEX

Abstract

Let equation image. We show that for many reducibilities, the requirement that a relation be intrinsically reducible to the α-th jump of a countable mode A has a syntactic equivalent. Furthermore, we show that many reducibilities coincide in such a situation

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Analytics

Added to PP
2013-11-03

Downloads
29 (#538,668)

6 months
5 (#638,139)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references