American Mathematical Society

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

  
Results: 1 to 30 of 34 found      Go to page: 1 2

[1] T. H. Payne. Effectively minimizing effective fixed-points . Proc. Amer. Math. Soc. 30 (1971) 561-562. MR 0285383.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[2] Richard A. Platek. A note on the failure of the relativized enumeration theorem in recursive function theory . Proc. Amer. Math. Soc. 25 (1970) 915-916. MR 0263625.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[3] Carl G. Jockusch and Robert I. Soare. Minimal covers and arithmetical sets . Proc. Amer. Math. Soc. 25 (1970) 856-859. MR 0265154.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[4] A. H. Lachlan and E. W. Madison. Computable fields and arithmetically definable ordered fields . Proc. Amer. Math. Soc. 24 (1970) 803-807. MR 0253897.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[5] James C. Owings. Commutativity and common fixed points in recursion theory . Proc. Amer. Math. Soc. 24 (1970) 385-387. MR 0260592.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[6] R. J. Fabian and C. F. Kent. Recursive functions defined by ordinal recursions . Proc. Amer. Math. Soc. 23 (1969) 206-210. MR 0249293.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[7] V. D. Vučković. Almost recursive sets . Proc. Amer. Math. Soc. 23 (1969) 114-119. MR 0260593.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[8] C. F. Kent. Reducing ordinal recursion . Proc. Amer. Math. Soc. 22 (1969) 690-696. MR 0265156.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[9] Julia Robinson. Finitely generated classes of sets of natural numbers . Proc. Amer. Math. Soc. 21 (1969) 608-614. MR 0253898.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[10] Julia Robinson. Recursive functions of one variable . Proc. Amer. Math. Soc. 19 (1968) 815-820. MR 0230618.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[11] Julia Robinson. Finite generation of recursively enumerable sets . Proc. Amer. Math. Soc. 19 (1968) 1480-1486. MR 0239974.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[12] A. H. Lachlan. Complete recursively enumerable sets . Proc. Amer. Math. Soc. 19 (1968) 99-102. MR 0221933.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[13] K. I. Appel. No recursively enumerable set is the union of finitely many immune retraceable sets . Proc. Amer. Math. Soc. 18 (1967) 279-281. MR 0207548.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[14] Gerald E. Sacks. On a theorem of Lachlan and Martin . Proc. Amer. Math. Soc. 18 (1967) 140-141. MR 0207558.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[15] V. D. Vuckovic. Creative and weakly creative sequences of r.e. sets . Proc. Amer. Math. Soc. 18 (1967) 478-483. MR 0213235.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[16] William E. Ritter. Representability of partial recursive functions in formal theories . Proc. Amer. Math. Soc. 18 (1967) 647-651. MR 0230617.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[17] J. B. Florence. Infinite subclasses of recursively enumerable classes . Proc. Amer. Math. Soc. 18 (1967) 633-639. MR 0218234.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[18] T. G. McLaughlin. Retraceable sets and recursive permutations . Proc. Amer. Math. Soc. 17 (1966) 427-429. MR 0188066.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[19] Willaim E. Ritter. Notation systems and an effective fixed point property . Proc. Amer. Math. Soc. 17 (1966) 390-395. MR 0201297.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[20] Louise Hay. Isomorphism types of index sets of partial recursive functions . Proc. Amer. Math. Soc. 17 (1966) 106-110. MR 0186541.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[21] Paul R. Young. A theorem on recursively enumerable classes and splinters . Proc. Amer. Math. Soc. 17 (1966) 1050-1056. MR 0207556.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[22] Donald A. Martin. Completeness, the recursion theorem, and effectively simple sets . Proc. Amer. Math. Soc. 17 (1966) 838-842. MR 0216950.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[23] A. H. Lachlan. On a problem of G. E. Sacks . Proc. Amer. Math. Soc. 16 (1965) 972-979. MR 0182560.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[24] Hartley Rogers. On universal functions . Proc. Amer. Math. Soc. 16 (1965) 39-44. MR 0171705.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[25] A. H. Lachlan. Effective inseparability for sequences of sets . Proc. Amer. Math. Soc. 16 (1965) 647-653. MR 0182559.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[26] Marian Boykan Pour-El. G\"odel numberings versus Friedberg numberings . Proc. Amer. Math. Soc. 15 (1964) 252-256. MR 0174479.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[27] Raymond M. Smullyan. Effectively simple sets . Proc. Amer. Math. Soc. 15 (1964) 893-895. MR 0180485.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[28] Paul R. Young. On reducibility by recursive functions . Proc. Amer. Math. Soc. 15 (1964) 889-892. MR 0179079.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[29] Gerald E. Sacks. A simple set which is not effectively simple . Proc. Amer. Math. Soc. 15 (1964) 51-55. MR 0156780.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[30] T. G. McLaughlin. A theorem on productive functions . Proc. Amer. Math. Soc. 14 (1963) 444. MR 0147385.
Abstract, references, and article information
View Article: PDF
This article is available free of charge


Results: 1 to 30 of 34 found      Go to page: 1 2