K. I. Appel. No recursively enumerable set is the union of finitely many immune retraceable sets. Proceedings of the American Mathematical Society, vol. 18 (1967). pp. 279–281.

C. E. M. Yates

doi:10.2307/2271403

K. I. Appel. No recursively enumerable set is the union of finitely many immune retraceable sets. Proceedings of the American Mathematical Society, vol. 18 (1967). pp. 279–281.

Journal of Symbolic Logic ◽

10.2307/2271403 ◽

1969 ◽

Vol 33 (4) ◽

pp. 621-621

Author(s):

C. E. M. Yates

Keyword(s):

American Mathematical Society ◽

Mathematical Society ◽

Recursively Enumerable Set ◽

Recursively Enumerable

Download Full-text

Hillary Putnam and R. M. Smullyan. Exact separation of recursively enumerable sets within theories. Proceedings of the American Mathematical Society, vol. 11 (1960), pp. 574–577.

Journal of Symbolic Logic ◽

10.2307/2963568 ◽

1960 ◽

Vol 25 (4) ◽

pp. 362-362

Author(s):

William Hanf

Keyword(s):

American Mathematical Society ◽

Mathematical Society ◽

Recursively Enumerable ◽

Recursively Enumerable Sets ◽

Exact Separation

Download Full-text

A. A. Mučnik. Izomorfizm sistém rékursivno péréčislimyh množéstv s efféktivnymi svojstvami. Trudy Moskovskogo Matématičéskogo Obščéstva, Vol. 7 (1958), pp. 407–412. - A. A. Mučnik. Isomorphism of systems of recursively enumerable sets with effective properties. English translation of the preceding by E. Mendelson. American Mathematical Society translations, ser. 2 vol. 23 (1963), pp. 7–13.

Journal of Symbolic Logic ◽

10.2307/2270793 ◽

1967 ◽

Vol 32 (3) ◽

pp. 393-394

Author(s):

A. H. Lachlan

Keyword(s):

English Translation ◽

Effective Properties ◽

American Mathematical Society ◽

Mathematical Society ◽

Recursively Enumerable ◽

Recursively Enumerable Sets

Download Full-text

J. C. E. Dekker. Two notes on recursively enumerable sets. Proceedings of the American Mathematical Society, vol. 4 (1953), pp. 495–501.

Journal of Symbolic Logic ◽

10.2307/2268087 ◽

1955 ◽

Vol 20 (1) ◽

pp. 73-74

Author(s):

Martin Davis

Keyword(s):

American Mathematical Society ◽

Mathematical Society ◽

Recursively Enumerable ◽

Recursively Enumerable Sets

Download Full-text

Emil L. Post. Recursively enumerable sets of positive integers and their decision problems. Bulletin of the American Mathematical Society, vol. 50 (1944), pp. 284–316.

Journal of Symbolic Logic ◽

10.2307/2267203 ◽

1945 ◽

Vol 10 (1) ◽

pp. 18-19

Author(s):

J. C. C. McKinsey

Keyword(s):

American Mathematical Society ◽

Decision Problems ◽

Mathematical Society ◽

Recursively Enumerable ◽

Recursively Enumerable Sets ◽

Positive Integers

Download Full-text

Robert I. Soare. Recursion theory and Dedekind cuts. Transactions of the American Mathematical Society, vol. 140 (1969), pp. 271–294. - Robert I. Soare. Cohesive sets and recursively enumerable Dedekind cuts. Pacific Journal of mathematics, vol. 31 (1969), pp. 215–231.

Journal of Symbolic Logic ◽

10.2307/2271527 ◽

1971 ◽

Vol 36 (1) ◽

pp. 148-148

Author(s):

Brian H. Mayoh

Keyword(s):

American Mathematical Society ◽

Recursion Theory ◽

Mathematical Society ◽

Recursively Enumerable ◽

Dedekind Cuts

Download Full-text

Louise Hay. On creative sets and indices of partial recursive functions. Transactions of the American Mathematical Society, vol. 120 no. 2 (for 1965, pub. 1966), pp. 359–367. - Louise Hay. Isomorphism types of index sets of partial recursive functions. Proceedings of the American Mathematical Society, vol. 17 (1966), pp. 106–110. - Louise Hay. Index sets of finite classes of recursively enumerable sets. The journal of symbolic logic, vol. 34 (1969), pp. 39–44.

Journal of Symbolic Logic ◽

10.2307/2272380 ◽

1974 ◽

Vol 39 (1) ◽

pp. 186-187

Author(s):

Forbes D. Lewis

Keyword(s):

American Mathematical Society ◽

Mathematical Society ◽

Symbolic Logic ◽

Recursive Functions ◽

Recursively Enumerable ◽

Index Sets ◽

Recursively Enumerable Sets ◽

Partial Recursive Functions

Download Full-text

J. C. E. Dekker and J. Myhill. Some theorems on classes of recursively enumerable sets. Transactions of the American Mathematical Society, vol. 89 (1958), pp. 25–59.

Journal of Symbolic Logic ◽

10.2307/2963695 ◽

1962 ◽

Vol 27 (1) ◽

pp. 84-84

Author(s):

Martin Davis

Keyword(s):

American Mathematical Society ◽

Mathematical Society ◽

Recursively Enumerable ◽

Recursively Enumerable Sets

Download Full-text

William W. Boone. Partial results regarding word problems and recursively enumerable degrees of unsolvability. Bulletin of the American Mathematical Society, vol. 68 (1962), pp. 616–623.

Journal of Symbolic Logic ◽

10.2307/2271316 ◽

1963 ◽

Vol 28 (4) ◽

pp. 292-292

Author(s):

Marian Boykan Pour-El

Keyword(s):

Word Problems ◽

American Mathematical Society ◽

Mathematical Society ◽

Recursively Enumerable ◽

Degrees Of Unsolvability

Download Full-text

Robert W. Robinson. Simplicity of recursively enumerable sets.The journal of symbolic logic, vol. 32 (1967), pp. 162–172. - Robert W. Robinson. Two theorems on hyperhypersimple sets. Transactions of the American Mathematical Society, vol. 128 (1967), pp. 531–538. - A. H. Lachlan. On the lattice of recursively enumerable sets.Transactions of the American Mathematical Society, vol. 130 (1968), pp. 1–37. - A. H. Lachlan. The elementary theory of recursively enumerable sets. Duke mathematical journal, vol. 35 (1968), pp. 123–146.

Journal of Symbolic Logic ◽

10.1017/s0022481200092781 ◽

1970 ◽

Vol 35 (1) ◽

pp. 153-155

Author(s):

James C. Owings

Keyword(s):

Elementary Theory ◽

American Mathematical Society ◽

Mathematical Journal ◽

Mathematical Society ◽

Symbolic Logic ◽

Duke Mathematical Journal ◽

Recursively Enumerable ◽

Recursively Enumerable Sets

Download Full-text

H. G. Rice. Recursive and recursively enumerable orders. Transactions of the American Mathematical Society, vol. 83 (1956), pp. 277–300.

Journal of Symbolic Logic ◽

10.2307/2963944 ◽

1957 ◽

Vol 22 (4) ◽

pp. 375-375

Author(s):

Martin Davis

Keyword(s):

American Mathematical Society ◽

Mathematical Society ◽

Recursively Enumerable

Download Full-text