On Splitting of a Recursive Set with Polynomial Time Minimal Pairs

Mathematical Logic Quarterly 35 (5):423-432 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

reprint Zhixiang, Chen (1989) "On Splitting of a Recursive Set with Polynomial Time Minimal Pairs". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35(5):423-432

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,290

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

Exact Pairs for Abstract Bounded Reducibilities.Wolfgang Merkle - 1999 - Mathematical Logic Quarterly 45 (3):343-360.
Feasible Graphs and Colorings.Douglas Cenzer & Jeffrey Remmel - 1995 - Mathematical Logic Quarterly 41 (3):327-352.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
Polynomial-time abelian groups.Douglas Cenzer & Jeffrey Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):313-363.
Some More Minimal Pairs of α‐Recursively Enumerable Degrees.Richard A. Shore - 1978 - Mathematical Logic Quarterly 24 (25‐30):409-418.
Machines Over the Reals and Non‐Uniformity.Felipe Cucker - 1997 - Mathematical Logic Quarterly 43 (2):143-157.

Analytics

Added to PP
2013-12-01

Downloads
17 (#1,138,780)

6 months
4 (#1,232,162)

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

No references found.

Add more references