Remote Access Bulletin of the American Mathematical Society

Bulletin of the American Mathematical Society

ISSN 1088-9485(online) ISSN 0273-0979(print)

 
 

 

Automorphisms of the lattice of recursively enumerable sets


Author: Robert I. Soare
Journal: Bull. Amer. Math. Soc. 80 (1974), 53-58
MSC (1970): Primary 02F25; Secondary 02F30
DOI: https://doi.org/10.1090/S0002-9904-1974-13350-1
MathSciNet review: 0373858
Full-text PDF

References | Similar Articles | Additional Information

References [Enhancements On Off] (What's this?)

  • 1. A. H. Lachlan, On the lattice of recursively enumerable sets, Trans. Amer. Math. Soc. 130 (1968), 1-37. MR 37 #2594. MR 227009
  • 2. A. H. Lachlan, The elementary theory of recursively enumerable sets, Duke Math. J. 35 (1968), 123-146. MR 37 #2593. MR 227008
  • 3. A. H. Lachlan, Degrees of recursively enumerable sets which have no maximal superset, J. Symbolic Logic 33 (1968), 431-443. MR 38 #4314. MR 236016
  • 4. A. H. Lachlan, On some games which are relevant to the theory of recursively enumerable sets, Ann. of Math. (2) 91 (1970), 291-310. MR 44 #1652. MR 284333
  • 5. M. Lerman, Some theorems on r-maximal sets and major subsets of recursively enumerable sets, J. Symbolic Logic 36 (1971), 193-215. MR 45 #3200. MR 294127
  • 6. M. Lerman, Admissible ordinals and priority arguments, Proceedings of the Cambridge Summer School in Logic 1971, Springer-Verlag, (to appear). MR 379153
  • 7. D. A. Martin, Classes of recursively enumerable sets and degrees of unsolvability, Z. Math. Logik Grundlagen Math. 12 (1966), 295-310. MR 37 #68. MR 224469
  • 8. E. L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. 50 (1944), 284-316. MR 6, 29. MR 10514
  • 9. R. W. Robinson, Recursively enumerable sets not contained in any maximal set, Notices Amer. Math. Soc. 13 (1966), 325. Abstract #632-4.
  • 10. H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967. MR 37 #61. MR 224462
  • 11. G. E. Sacks, Degrees of unsolvability, rev. ed., Ann. of Math. Studies, no. 55, Princeton Univ. Press, Princeton, N.J., 1966. MR 186554
  • 12. G. E. Sacks, The recursively enumerable degrees are dense, Ann. of Math. (2) 80 (1964), 300-312. MR 29 #3367. MR 166089
  • 13. G. E. Sacks, Recursive enumerability and the jump operator, Trans. Amer. Math. Soc. 108 (1963), 223-239. MR 27 #5681. MR 155747
  • 14. G. E. Sacks, A maximal set which is not complete, Michigan Math. J. 11 (1964), 193-205. MR 29 #3368. MR 166090
  • 15. R. I. Soare, Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets, Ann. of Math. (to appear). MR 373858
  • 16. R. I. Soare, Automorphisms of the lattice of recursively enumerable sets. III: High degrees (to appear). MR 373858
  • 17. R. I. Soare, Automorphisms of the lattice of recursively enumerable sets. II: Low degrees (to appear). MR 373858
  • 18. C. E. M. Yates, Three theorems on the degree of recursively enumerable sets, Duke Math. J. 32 (1965), 461-468. MR 31 #4721. MR 180486

Similar Articles

Retrieve articles in Bulletin of the American Mathematical Society with MSC (1970): 02F25, 02F30

Retrieve articles in all journals with MSC (1970): 02F25, 02F30


Additional Information

DOI: https://doi.org/10.1090/S0002-9904-1974-13350-1

American Mathematical Society