American Mathematical Society

My Account · My Cart · Customer Services · FAQ  
AMS eContent Search Results
Matches for: msc=(02F25) AND publication=(all)
Sort order: Date
Format: Standard display

  
Results: 1 to 18 of 18 found      Go to page: 1

[1] Leo Harrington and Saharon Shelah. The undecidability of the recursively enumerable degrees. Bull. Amer. Math. Soc. 6 (1982) 79-80. MR 634436.
Abstract, references, and article information   
View Article: PDF

[2] James P. Jones. Undecidable diophantine equations. Bull. Amer. Math. Soc. 3 (1980) 859-862. MR 578379.
Abstract, references, and article information   
View Article: PDF

[3] Robert I. Soare. Recursively enumerable sets and degrees. Bull. Amer. Math. Soc. 84 (1978) 1149-1181. MR 508451.
Abstract, references, and article information   
View Article: PDF

[4] C. Smoryński. Avoiding self-referential statements . Proc. Amer. Math. Soc. 70 (1978) 181-184. MR 0476452.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[5] T. G. McLaughlin. On the relations between some rate-of-growth conditions . Proc. Amer. Math. Soc. 69 (1978) 151-155. MR 0498050.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[6] Richard A. Shore. Determining automorphisms of the recursively enumerable sets . Proc. Amer. Math. Soc. 65 (1977) 318-325. MR 0446931.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[7] Paul H. Morris. A reducibility condition for recursiveness . Proc. Amer. Math. Soc. 60 (1976) 270-272. MR 0416880.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[8] Nancy Ann Lynch, Albert R. Meyer and Michael J. Fischer. Relativization of the theory of computational complexity . Trans. Amer. Math. Soc. 220 (1976) 243-287. MR 0403933.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[9] J. R. Shoenfield. The decision problem for recursively enumerable degrees. Bull. Amer. Math. Soc. 81 (1975) 973-977. MR 0387035.
Abstract, references, and article information   
View Article: PDF

[10] Robert I. Soare. Automorphisms of the lattice of recursively enumerable sets. Bull. Amer. Math. Soc. 80 (1974) 53-58. MR 0373858.
Abstract, references, and article information   
View Article: PDF

[11] Leonard P. Sasso. Deficiency sets and bounded information reducibilities . Trans. Amer. Math. Soc. 200 (1974) 267-290. MR 0469729.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[12] T. G. McLaughlin. On retraceable sets with rapid growth . Proc. Amer. Math. Soc. 40 (1973) 573-576. MR 0340010.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[13] Richard E. Ladner. A completely mitotic nonrecursive r.e. degree . Trans. Amer. Math. Soc. 184 (1973) 479-507. MR 0398805.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[14] Louise Hay. Discrete $\omega $-sequences of index sets . Trans. Amer. Math. Soc. 183 (1973) 293-311. MR 0349365.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[15] Louise Hay. The halting problem relativized to complements . Proc. Amer. Math. Soc. 41 (1973) 583-587. MR 0327495.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[16] T. H. Payne. Sequences having an effective fixed-point property . Trans. Amer. Math. Soc. 165 (1972) 227-237. MR 0389560.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[17] John W. Berry. Almost recursively enumerable sets . Trans. Amer. Math. Soc. 164 (1972) 241-253. MR 0363839.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[18] C. E. Hughes, Ross Overbeek and W. E. Singletary. The many-one equivalence of some general combinatorial decision problems. Bull. Amer. Math. Soc. 77 (1971) 467-472. MR 0281609.
Abstract, references, and article information   
View Article: PDF


Results: 1 to 18 of 18 found      Go to page: 1