Robert A. DiPaola. Pseudo-complements and ordinal logics based on consistency statements. The journal of symbolic logic, vol. 31 (1966), pp. 359–364. - Robert A. Dipaola. Some properties of pseudo-complements of recursively enumerable sets. Transactions of the American Mathematical Society, vol. 121 (1966), pp. 296–308.

J. R. Shoenfield

doi:10.2307/2272996

Robert A. DiPaola. Pseudo-complements and ordinal logics based on consistency statements. The journal of symbolic logic, vol. 31 (1966), pp. 359–364. - Robert A. Dipaola. Some properties of pseudo-complements of recursively enumerable sets. Transactions of the American Mathematical Society, vol. 121 (1966), pp. 296–308.

Journal of Symbolic Logic ◽

10.2307/2272996 ◽

1972 ◽

Vol 37 (2) ◽

pp. 406-406

Author(s):

J. R. Shoenfield

Keyword(s):

American Mathematical Society ◽

Mathematical Society ◽

Symbolic Logic ◽

Recursively Enumerable ◽

Recursively Enumerable Sets

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

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

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

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

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

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

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

Soare Robert I.. Automorphisms of the lattice of recursively enumerable sets. Part I: maximal sets. Annals of mathematics, ser. 2 vol. 100 (1974), pp. 80–120. - Lerman Manuel and Soare Robert I.. d-Simple sets, small sets, and degree classes. Pacific journal of mathematics, vol. 87 (1980), pp. 135–155. - Cholak Peter. Automorphisms of the lattice of recursively enumerable sets. Memoirs of the American Mathematical Society, no. 541. American Mathematical Society, Providence1995, viii + 151 pp. - Harrington Leo and Soare Robert I.. The Δ30-automorphism method and noninvariant classes of degrees. Journal of the American Mathematical Society, vol. 9 (1996), pp. 617–666.

Journal of Symbolic Logic ◽

10.2307/2275592 ◽

1997 ◽

Vol 62 (3) ◽

pp. 1048-1055

Author(s):

Rod Downey

Keyword(s):

American Mathematical Society ◽

Mathematical Society ◽

Recursively Enumerable ◽

Recursively Enumerable Sets ◽

Simple Sets

H. G. Rice. Classes of recursively enumerable sets and their decision problems. Transactions of the American Mathematical Society, vol. 74 (1953) pp. 358–366.

Journal of Symbolic Logic ◽

10.2307/2268870 ◽

1954 ◽

Vol 19 (2) ◽

pp. 121-122

Author(s):

Rózsa Péter

Keyword(s):

American Mathematical Society ◽

Decision Problems ◽

Mathematical Society ◽

Recursively Enumerable ◽

Recursively Enumerable Sets

S. C. Kleene. Permutability of inferences in Gentzen's calculi LK and LJ. Two papers on the predicate calculus, by S. C. Kleene (Memoirs of the American Mathematical Society, no. 10), lithographed, Providence1952, pp. 1–26. - S. C. Kleene. Finite axiomatizability of theories in the predicate calculus using additional predicate symbols. Two papers on the predicate calculus, by S. C. Kleene (Memoirs of the American Mathematical Society, no. 10), lithographed, Providence1952, pp. 27–66. - S. C. Kleene. Bibliography. Two papers on the predicate calculus, by S. C. Kleene (Memoirs of the American Mathematical Society, no. 10), lithographed, Providence1952, pp. 67–68. - William Craig. On axiomatizability within a system. The journal of symbolic logic, vol. 18 (1953), pp. 30–32.

Journal of Symbolic Logic ◽

10.2307/2267666 ◽

1954 ◽

Vol 19 (1) ◽

pp. 62-63

Author(s):

Robert McNaughton

Keyword(s):

American Mathematical Society ◽

Predicate Calculus ◽

Mathematical Society ◽

Symbolic Logic ◽

Finite Axiomatizability