A minimal pair of Π1 0 classes

&
Journal of Symbolic Logic 36 (1):66-78 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271516

Other Versions

No versions found

Links

PhilArchive



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

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

The importance of Π1 0 classes in effective randomness.George Barmpalias, Andrew E. M. Lewis & Keng Meng Ng - 2010 - Journal of Symbolic Logic 75 (1):387-400.
[Omnibus Review].Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
Soare Robert I.. Automorphisms of the lattice of recursively enumerable sets. Part I: maximal sets. Annals of mathematics, ser. 2 vol. 100 , pp. 80–120. - Lerman Manuel and Soare Robert I.. d-Simple sets, small sets, and degree classes. Pacific journal of mathematics, vol. 87 , pp. 135–155. - Cholak Peter. Automorphisms of the lattice of recursively enumerable sets. Memoirs of the American Mathematical Society, no. 541. American Mathematical Society, Providence1995, viii + 151 pp. - Harrington Leo and Soare Robert I.. The Δ30-automorphism method and noninvariant classes of degrees. Journal of the American Mathematical Society, vol. 9 , pp. 617–666. [REVIEW]Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
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.
d-computable Categoricity for Algebraic Fields.Russell Miller - 2009 - Journal of Symbolic Logic 74 (4):1325 - 1351.
A weakly 2-generic which Bounds a minimal degree.Rodney G. Downey & Satyadev Nandakumar - 2019 - Journal of Symbolic Logic 84 (4):1326-1347.
Robert I. Soare. Recursion theory and Dedekind cuts. Transactions of the American Mathematical Society, vol. 140 , pp. 271–294. - Robert I. Soare. Cohesive sets and recursively enumerable Dedekind cuts. Pacific Journal of mathematics, vol. 31 , pp. 215–231. [REVIEW]Brian H. Mayoh - 1971 - Journal of Symbolic Logic 36 (1):148.
Robert I. Soare, Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, Heidelberg, 2016, xxxvi + 263 pp. [REVIEW]Damir D. Dzhafarov - 2017 - Bulletin of Symbolic Logic 23 (1):113-115.
Splittings of 0' into the Recursively Enumerable Degrees.Xiaoding Yi - 1996 - Mathematical Logic Quarterly 42 (1):249-269.
Carl G. JockuschJr., and David B. Posner. Double jumps of minimal degrees. The journal of symbolic logic, vol. 43 no. 4 , pp. 715–724. - Carl G. JockuschJr., and David B. Posner. Automorphism bases for degrees of unsotvability. Israel journal of mathematics, vol. 40 , pp. 150–164. - Richard L. Epstein. Initial segments of degrees below 0′. Memoirs of the American Mathematical Society, no. 241. American Mathematical Society, Providence1981, vi + 102 pp. - Richard A. Shore. The theory of the degrees below 0′. The journal of the London Mathematical Society, ser. 2 vol. 24 , pp. 1–14.M. Lerman - 1985 - Journal of Symbolic Logic 50 (2):550-552.

Analytics

Added to PP
2009-01-28

Downloads
75 (#279,505)

6 months
15 (#206,160)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

An effectively closed set with no join property.Ahmet Çevik - 2021 - Mathematical Logic Quarterly 67 (3):313-320.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references