Automorphisms of the lattice of recursively enumerable sets
HTML articles powered by AMS MathViewer
- by Robert I. Soare PDF
- Bull. Amer. Math. Soc. 80 (1974), 53-58
References
- A. H. Lachlan, On the lattice of recursively enumerable sets, Trans. Amer. Math. Soc. 130 (1968), 1–37. MR 227009, DOI 10.1090/S0002-9947-1968-0227009-1
- A. H. Lachlan, The elementary theory of recursively enumerable sets, Duke Math. J. 35 (1968), 123–146. MR 227008, DOI 10.1215/S0012-7094-68-03513-8
- A. H. Lachlan, Degrees of recursively enumerable sets which have no maximal supersets, J. Symbolic Logic 33 (1968), 431–443. MR 236016, DOI 10.2307/2270328
- 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 284333, DOI 10.2307/1970579
- Manuel Lerman, Some theorems on $r$-maximal sets and major subsets of recursively enumerable sets, J. Symbolic Logic 36 (1971), 193–215. MR 294127, DOI 10.2307/2270255
- Manuel Lerman, Admissible ordinals and priority arguments, Cambridge Summer School in Mathematical Logic (Cambridge, 1971) Lecture Notes in Math., Vol. 337, Springer, Berlin, 1973, pp. 311–344. MR 0379153
- Donald A. Martin, Classes of recursively enumerable sets and degrees of unsolvability, Z. Math. Logik Grundlagen Math. 12 (1966), 295–310. MR 224469, DOI 10.1002/malq.19660120125
- Emil L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. 50 (1944), 284–316. MR 10514, DOI 10.1090/S0002-9904-1944-08111-1 9. R. W. Robinson, Recursively enumerable sets not contained in any maximal set, Notices Amer. Math. Soc. 13 (1966), 325. Abstract #632-4.
- Hartley Rogers Jr., Theory of recursive functions and effective computability, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1967. MR 0224462
- Gerald E. Sacks, Degrees of unsolvability, Princeton University Press, Princeton, N.J., 1963. MR 0186554
- Gerald E. Sacks, The recursively enumerable degrees are dense, Ann. of Math. (2) 80 (1964), 300–312. MR 166089, DOI 10.2307/1970393
- Gerald E. Sacks, Recursive enumerability and the jump operator, Trans. Amer. Math. Soc. 108 (1963), 223–239. MR 155747, DOI 10.1090/S0002-9947-1963-0155747-3
- Gerald E. Sacks, A maximal set which is not complete, Michigan Math. J. 11 (1964), 193–205. MR 166090
- Robert I. Soare, Automorphisms of the lattice of recursively enumerable sets, Bull. Amer. Math. Soc. 80 (1974), 53–58. MR 373858, DOI 10.1090/S0002-9904-1974-13350-1
- Robert I. Soare, Automorphisms of the lattice of recursively enumerable sets, Bull. Amer. Math. Soc. 80 (1974), 53–58. MR 373858, DOI 10.1090/S0002-9904-1974-13350-1
- Robert I. Soare, Automorphisms of the lattice of recursively enumerable sets, Bull. Amer. Math. Soc. 80 (1974), 53–58. MR 373858, DOI 10.1090/S0002-9904-1974-13350-1
- C. E. M. Yates, Three theorems on the degrees of recursively enumerable sets, Duke Math. J. 32 (1965), 461–468. MR 180486
Additional Information
- 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