On minimal pairs and minimal degrees in higher recursion theory

Archive for Mathematical Logic 18 (1):169-186 (1977)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/bf02007269

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,932

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

Minimal Degrees in Generalized Recursion Theory.Michael Machtey - 1974 - Mathematical Logic Quarterly 20 (8-12):133-148.
1-Generic degrees and minimal degrees in higher recursion theory, II.C. T. Chong - 1986 - Annals of Pure and Applied Logic 31:165-175.
Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.
Some minimal pairs of alpha-recursively enumerable degrees.Manuel Lerman - 1972 - Annals of Mathematical Logic 4 (4):415.
Some More Minimal Pairs of α‐Recursively Enumerable Degrees.Richard A. Shore - 1978 - Mathematical Logic Quarterly 24 (25‐30):409-418.
Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.Manuel Lerman - 1991 - Mathematical Logic Quarterly 37 (19‐22):331-342.
Review: Wolfgang Maass, Inadmissibility, Tame r.e. Sets and the Admissible Collapse; Wolfgang Maass, On $alpha$- and $beta$-Recursively Enumerable Degrees. [REVIEW]Steven Homer - 1981 - Journal of Symbolic Logic 46 (3):665-667.
Minimal α-recursion theoretic degrees.John M. MacIntyre - 1973 - Journal of Symbolic Logic 38 (1):18-28.
On minimal pairs of enumeration degrees.Kevin McEvoy & S. Barry Cooper - 1985 - Journal of Symbolic Logic 50 (4):983-1001.
Bounding and nonbounding minimal pairs in the enumeration degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741-766.

Analytics

Added to PP
2020-12-03

Downloads
2 (#1,824,835)

6 months
2 (#1,448,208)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Inadmissibility, tame R.E. sets and the admissible collapse.Wolfgang Maass - 1978 - Annals of Mathematical Logic 13 (2):149-170.
Inadmissibility, tame r.e. sets and the admissible collapse.Wolfgang Maass - 1978 - Annals of Mathematical Logic 13 (2):149.
Recursively invariant beta-recursion theory.Wolfgand Maass - 1981 - Annals of Mathematical Logic 21 (1):27.

Add more citations

References found in this work

No references found.

Add more references