ASH, CJ, Categoricity in hyperarithmetical degrees (1) BALDWIN, JT and HARRINGTON, L., Trivial pursuit: Re-marks on the main gap (3) COOPER, SB and EPSTEIN, RL, Complementing below re-cursively enumerable degrees (1) [Book Review]

Annals of Pure and Applied Logic 34 (1):311 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(87)90039-x

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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

ASH, CJ, Categoricity in hyperarithmetical degrees BALDWIN, JT and HARRINGTON, L., Trivial pursuit: Re-marks on the main gap COOPER, SB and EPSTEIN, RL, Complementing below re-cursively enumerable degrees.J. Steprans & S. Shelah - 1987 - Annals of Pure and Applied Logic 34:311.
Complementing below recursively enumerable degrees.S. Barry Cooper & Richard L. Epstein - 1987 - Annals of Pure and Applied Logic 34 (1):15-32.
On a problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.
Degrees of categoricity of computable structures.Ekaterina B. Fokina, Iskander Kalimullin & Russell Miller - 2010 - Archive for Mathematical Logic 49 (1):51-67.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
The discontinuity of splitting in the recursively enumerable degrees.S. Barry Cooper & Xiaoding Yi - 1995 - Archive for Mathematical Logic 34 (4):247-256.
Trivial pursuit: Remarks on the main gap.John T. Baldwin & Leo Harrington - 1987 - Annals of Pure and Applied Logic 34 (3):209-230.
Categoricity in hyperarithmetical degrees.C. J. Ash - 1987 - Annals of Pure and Applied Logic 34 (1):1-14.
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees.Klaus Ambos-Spies & Ding Decheng - 1994 - Mathematical Logic Quarterly 40 (3):287-317.
Degrees of Categoricity and the Hyperarithmetic Hierarchy.Barbara F. Csima, Johanna N. Y. Franklin & Richard A. Shore - 2013 - Notre Dame Journal of Formal Logic 54 (2):215-231.
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.

Analytics

Added to PP
2014-04-05

Downloads
10 (#1,129,009)

6 months
3 (#902,269)

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

A theorem on minimal degrees.J. R. Shoenfield - 1966 - Journal of Symbolic Logic 31 (4):539-544.
The upper semilattice of degrees ≤ 0' is complemented.David B. Posner - 1981 - Journal of Symbolic Logic 46 (4):705 - 713.
Degrees joining to 0'. [REVIEW]David B. Posner & Robert W. Robinson - 1981 - Journal of Symbolic Logic 46 (4):714 - 722.

Add more references