6 results
B. H. Mayoh. Groups and semigroups with solvable word problems. Proceedings of the American Mathematical Society, vol. 18 (1967), pp. 1038–1039.
-
- Journal:
- The Journal of Symbolic Logic / Volume 36 / Issue 3 / September 1971
- Published online by Cambridge University Press:
- 12 March 2014, p. 541
- Print publication:
- September 1971
-
- Article
- Export citation
A. Włodzimierz Mostowski. On the decidability of some problems in special classes of groups. Fundamenta mathematicae, vol. 59 (1966), pp. 123–135. - A. Włodzimierz Mostowski. Computational algorithms for deciding some problems for nilpotent groups. Fundamenta mathematicae, vol. 59 (1966), pp. 137–152.
-
- Journal:
- The Journal of Symbolic Logic / Volume 35 / Issue 3 / September 1970
- Published online by Cambridge University Press:
- 12 March 2014, pp. 476-477
- Print publication:
- September 1970
-
- Article
- Export citation
Clement F. Kent. Constructive analogues of the group of permutations of the natural numbers. Transactions of the American Mathematical Society, vol. 104 (1962), pp.347–362.
-
- Journal:
- The Journal of Symbolic Logic / Volume 34 / Issue 3 / 17 November 1969
- Published online by Cambridge University Press:
- 12 March 2014, pp. 517-518
- Print publication:
- 17 November 1969
-
- Article
- Export citation
T. Rado. On non-computable functions. The Bell System technical journal, vol. 41 (1962), pp. 877–884.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 4 / February 1968
- Published online by Cambridge University Press:
- 12 March 2014, p. 524
- Print publication:
- February 1968
-
- Article
- Export citation
Tibor Rado. On a simple source for non-computable functions. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N.Y., April 24, 25, 26, 1962, Microwave Research Institute symposia series vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, pp. 75–81.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 4 / February 1968
- Published online by Cambridge University Press:
- 12 March 2014, p. 524
- Print publication:
- February 1968
-
- Article
- Export citation
S. Tennenbaum. Degree of unsolvability and the rate of growth of functions. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N.Y., April 24, 25, 26, 1962, Microwave Research Institute symposia series vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, pp. 71–73.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 4 / February 1968
- Published online by Cambridge University Press:
- 12 March 2014, p. 524
- Print publication:
- February 1968
-
- Article
- Export citation