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)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

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

Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Mathematical Logic Quarterly 5 (7‐13):117-125.
On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.
Monotone reducibility and the family of infinite sets.Douglas Cenzer - 1984 - Journal of Symbolic Logic 49 (3):774-782.
Computably enumerable sets and quasi-reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
The Medvedev lattice of computably closed sets.Sebastiaan A. Terwijn - 2006 - Archive for Mathematical Logic 45 (2):179-190.
Sets without Subsets of Higher Many-One Degree.Patrizio Cintioli - 2005 - Notre Dame Journal of Formal Logic 46 (2):207-216.
Q1-degrees of c.e. sets.R. Sh Omanadze & Irakli O. Chitaia - 2012 - Archive for Mathematical Logic 51 (5-6):503-515.
Low sets without subsets of higher many-one degree.Patrizio Cintioli - 2011 - Mathematical Logic Quarterly 57 (5):517-523.
Bounds in the Turing reducibility of functions.Karol Habart & K. Habart - 1992 - Mathematical Logic Quarterly 38 (1):423-430.
Quasi‐completeness and functions without fixed‐points.Ilnur I. Batyrshin - 2006 - Mathematical Logic Quarterly 52 (6):595-601.

Analytics

Added to PP
2016-02-04

Downloads
39 (#354,726)

6 months
6 (#201,673)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.

View all 39 citations / Add more citations

References found in this work

No references found.

Add more references