Splitting into degrees with low computational strength

&
Annals of Pure and Applied Logic 169 (8):803-834 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2018.04.004

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,139

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

CUMMINGS, J., Possible behaviours for the Mitchell ordering DOUGHERTY, R., Critical points in an algebra of elementary embeddings DOWNEY, R. and STOB, M., Splitting theorems in recursion theory. [REVIEW]J. Vaananen - 1993 - Annals of Pure and Applied Logic 65:307.
A non-splitting theorem in the enumeration degrees.Mariya Ivanova Soskova - 2009 - Annals of Pure and Applied Logic 160 (3):400-418.
The computational strength of matchings in countable graphs.Stephen Flood, Matthew Jura, Oscar Levin & Tyler Markkanen - 2022 - Annals of Pure and Applied Logic 173 (8):103133.
Splitting theorems and the jump operator.R. G. Downey & Richard A. Shore - 1998 - Annals of Pure and Applied Logic 94 (1-3):45-52.
George Barmpalias, Andrew E. M. Lewis and Keng Meng NG. The importance of Π 0 1 classes in effective randomness. The Journal of Symbolic Logic, vol. 75 (2010), pp. 387–400. - George Barmpalias, Andrew E. M. Lewis and Frank Stephan. Π 0 1 classes, LR degrees and Turing degrees. Annals of Pure and Applied Logic, vol. 156 (2008), pp. 21–38. - Antonin Kučera. Measure, Π 0 1 classes and complete extensions of PA. Recursion Theory Week (Oberwofach, 1984). Lecture Notes in Mathematics, vol. 1141. Springer, Berlin, 1985, pp. 245–259. - Frank Stephan. Martin-Löf randomness and PA complete sets. Logic Colloquium '02. Lecture Notes in Logic, vol. 27, Association for Symbolic Logic, La Jolla, CA, 2006, pp. 342–348. [REVIEW]Douglas Cenzer - 2012 - Bulletin of Symbolic Logic 18 (3):409-412.
Low upper bounds in the LR degrees.David Diamondstone - 2012 - Annals of Pure and Applied Logic 163 (3):314-320.
BAILEY, C. and DOWNEY, R., Tabular degrees in (Y-recursion theory BALDWIN, JT and SHELAH, S., The primal framework II: Smoothness BERARDUCCI, A. and INTRIGILA, B., Combinatorial. [REVIEW]Sb Cooper, L. Harrington & Ah Lachlan - 1992 - Annals of Pure and Applied Logic 55:321.
Laforte, G., see Downey, R.T. Arai, Z. Chatzidakis & A. Pillay - 1998 - Annals of Pure and Applied Logic 95 (1-3):287.
Tabular degrees in \Ga-recursion theory.Colin Bailey & Rod Downey - 1992 - Annals of Pure and Applied Logic 55 (3):205-236.
Abrahamson, KA, Downey, RG and Fellows, MR.R. Banacb, H. Barendregt, J. A. Bergstra, J. V. Tucker, J. Brendle, I. Moerdijk, E. Palmgren, J. I. Seiferas, A. R. Meyer & J. Terlouw - 1995 - Annals of Pure and Applied Logic 73 (1):327.

Analytics

Added to PP
2018-04-20

Downloads
23 (#942,055)

6 months
7 (#711,641)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Minimal pairs and high recursively enumerable degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
On very high degrees.Keng Meng Ng - 2008 - Journal of Symbolic Logic 73 (1):309-342.

Add more references