Lachlan A. H.. Lower bounds for pairs of recursively enumerable degrees. Proceedings of the London Mathematical Society, set. 3 vol. 16 part 3 , pp. 537–569 [Book Review]

Journal of Symbolic Logic 37 (3):611-611 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272773

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,945

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

Robert W. Robinson. Simplicity of recursively enumerable sets.The journal of symbolic logic, vol. 32 , pp. 162–172. - Robert W. Robinson. Two theorems on hyperhypersimple sets. Transactions of the American Mathematical Society, vol. 128 , pp. 531–538. - A. H. Lachlan. On the lattice of recursively enumerable sets.Transactions of the American Mathematical Society, vol. 130 , pp. 1–37. - A. H. Lachlan. The elementary theory of recursively enumerable sets. Duke mathematical journal, vol. 35 , pp. 123–146. [REVIEW]James C. Owings - 1970 - Journal of Symbolic Logic 35 (1):153-155.
A. H. Lachlan. The impossibility of finding relative complements for recursively enumerable degrees. The journal of symbolic logic, vol. 31 , pp. 434–454. [REVIEW]Gerald E. Sacks - 1971 - Journal of Symbolic Logic 36 (3):539-540.
A. H. Lachlan. On a problem of G. E. Sacks. Proceedings of the American Mathematical Society, vol. 16 , pp. 972–979.Gustav B. Hensel - 1967 - Journal of Symbolic Logic 32 (1):125.
Rice H. G.. Recursive and recursively enumerable orders. Transactions of the American Mathematical Society, vol. 83 , pp. 277–300. [REVIEW]Martin Davis - 1957 - Journal of Symbolic Logic 22 (4):375-375.
Rice H. G.. Classes of recursively enumerable sets and their decision problems. Transactions of the American Mathematical Society, vol. 74 pp. 358–366. [REVIEW]Rózsa Péter - 1954 - Journal of Symbolic Logic 19 (2):121-122.
Cooper S. B.. Degrees of unsolvability complementary between recursively enumerable degrees, Part I. Annals of mathematical logic, vol. 4 no. 1 , pp. 31–73. [REVIEW]Dick Epstein - 1975 - Journal of Symbolic Logic 40 (1):86-86.
A. A. Fridman. Stépéni nérazréšimosti problémy toždéstva v konéčno oprédélénnyh gruppah. Doklady Akadémii Nauk SSSR, vol. 147 , pp. 805–808. - A. A. Fridman. Degrees of insolvability of the word problem in finitely defined groups. English translation of the preceding by Sue Ann Walker. Soviet mathematics, vol. 3 no. 6 , pp. 1733–1737. - C. R. J. Clapham. Finitely presented groups with word problems of arbitrary degrees of insolubility. Proceedings of the London Mathematical Society, ser. 3 vol. 14 , pp. 633–676. - William W. Boone. Finitely presented group whose word problem has the same degree as that of an arbitrarily given Thue system . Proceedings of the National Academy of Sciences, vol. 53 , pp. 265–269. - William W. Boone. Word problems and recursively enumerable degrees of unsolvability. A first paper on Thue systems. Annals of mathematics, ser. 2 vol. 83 , pp. 520–571. - William W. Boone. Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely p. [REVIEW]J. C. Shepherdson - 1968 - Journal of Symbolic Logic 33 (2):296-297.
Splittings of 0' into the Recursively Enumerable Degrees.Xiaoding Yi - 1996 - Mathematical Logic Quarterly 42 (1):249-269.
Lachlan A. H.. On some games which are relevant to the theory of recursively enumerable sets. Annals of mathematics, ser. 2 vol. 91 , pp. 291–310. [REVIEW]Gregory W. Jones - 1974 - Journal of Symbolic Logic 39 (2):345-345.
Computability, enumerability, unsolvability, Directions in recursion theory, edited by S. B. Cooper, T. A. Slaman, and S. S. Wainer, London Mathematical Society lecture note series, no. 224, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, vii + 347 pp. - Leo Harrington and Robert I. Soare, Dynamic properties of computably enumerable sets, Pp. 105–121. - Eberhard Herrmann, On the ∀∃-theory of the factor lattice by the major subset relation, Pp. 139–166. - Manuel Lerman, Embeddings into the recursively enumerable degrees, Pp. 185–204. - Xiaoding Yi, Extension of embeddings on the recursively enumerable degrees modulo the cappable degrees, Pp. 313–331. - André Nies, Relativization of structures arising from computability theory. Pp. 219–232. - Klaus Ambos-Spies, Resource-bounded genericity. Pp. 1–59. - Rod Downey, Carl G. Jockusch, and Michael Stob. Array nonrecursive degrees and genericity, Pp. 93–104. - Masahiro Kumabe, Degrees of generic sets, Pp. 167–183. [REVIEW]C. T. Chong - 1999 - Journal of Symbolic Logic 64 (3):1362-1365.

Analytics

Added to PP
2013-11-02

Downloads
36 (#686,356)

6 months
15 (#201,699)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
A non-inversion theorem for the jump operator.Richard A. Shore - 1988 - Annals of Pure and Applied Logic 40 (3):277-303.

View all 27 citations / Add more citations

References found in this work

No references found.

Add more references