Reducibility and Completeness for Sets of Integers

&
Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13):117-125 (1959)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19590050703

Other Versions

original Friedberg, Richard M.; Rogers, Hartley (1959) "Reducibility and Completeness for Sets of Integers". Mathematical Logic Quarterly 5(7‐13):117-125
reprint Friedberg, Richard M.; Rogers, Hartley (1960) "Reducibility and Completeness for Sets of Integers". Journal of Symbolic Logic 25(4):362-363

Links

PhilArchive



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

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

Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Mathematical Logic Quarterly 5 (7‐13):117-125.
Richard M. Friedberg and Hartley RogersJr., Reducibility and completeness for sets of integers. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 , pp. 117–125. [REVIEW]Gerald E. Sacks - 1960 - Journal of Symbolic Logic 25 (4):362-363.

Analytics

Added to PP
2016-02-04

Downloads
51 (#447,550)

6 months
3 (#1,061,821)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Then-rea enumeration degrees are dense.Alistair H. Lachlan & Richard A. Shore - 1992 - Archive for Mathematical Logic 31 (4):277-285.
Jumps of quasi-minimal enumeration degrees.Kevin McEvoy - 1985 - Journal of Symbolic Logic 50 (3):839-848.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.

View all 38 citations / Add more citations

References found in this work

No references found.

Add more references