Reducibility and Completeness for Sets of Integers

Richard M. Friedberg & Hartley Rogers

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

Abstract

This article has no associated abstract. (fix it)

Cite

Plain text

BibTeX

Formatted text

Reference Manager

RefWorks

Options

Mark as duplicate

Find it on Scholar

Request removal from index

Revision history

Categories

Areas of Mathematics in Philosophy of Mathematics

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: 100,925

External links

From the Publisher via CrossRef (no proxy)

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

Through your library

Sign in / register and customize your OpenURL resolver
Configure custom resolver

My notes

Sign in to use this feature

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 (#406,659)

6 months
6 (#795,030)

Historical graph of downloads

How can I increase my downloads?

Citations of this work

The weak truth table degrees of recursively enumerable sets.Richard E. Ladner & Leonard P. Sasso - 1975 - Annals of Mathematical Logic 8 (4):429-448.

Turing oracle machines, online computing, and three displacements in computability theory.Robert I. Soare - 2009 - Annals of Pure and Applied Logic 160 (3):368-399.

Jumps of quasi-minimal enumeration degrees.Kevin McEvoy - 1985 - Journal of Symbolic Logic 50 (3):839-848.

Then-rea enumeration degrees are dense.Alistair H. Lachlan & Richard A. Shore - 1992 - Archive for Mathematical Logic 31 (4):277-285.

Cupping and noncupping in the enumeration degrees of ∑20 sets.S. Barry Cooper, Andrea Sorbi & Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (3):317-342.

View all 39 citations / Add more citations

References found in this work

No references found.

Add more references