7 results
An easier enumeration of self-complementary graphs
-
- Journal:
- Proceedings of the Edinburgh Mathematical Society / Volume 27 / Issue 2 / June 1984
- Published online by Cambridge University Press:
- 20 January 2009, pp. 181-183
-
- Article
-
- You have access
- Export citation
William W. Boone, Frank B. Cannonito, and Roger C. Lyndon. Introduction. Word problems, Decision problems and the Burnside problem in group theory, edited by W. W. Boone, F. B. Cannonito, and R. C. Lyndon, Studies in logic and the foundations of mathematics, vol. 71, North-Holland Publishing Company, Amsterdam and London1973, pp. ix–xii.
-
- Journal:
- The Journal of Symbolic Logic / Volume 41 / Issue 4 / December 1976
- Published online by Cambridge University Press:
- 12 March 2014, pp. 785-788
- Print publication:
- December 1976
-
- Article
- Export citation
Donald J. Collins. On recognising properties of groups which have solvable word problem. Archiv der Mathematik, vol. 21 (1970), pp. 31–39.
-
- Journal:
- The Journal of Symbolic Logic / Volume 39 / Issue 2 / June 1974
- Published online by Cambridge University Press:
- 12 March 2014, p. 340
- Print publication:
- June 1974
-
- Article
- Export citation
Donald J. Collins. Recursively enumerable degrees and the conjugacy problem. Acta mathematica, vol. 122 (1969), pp. 115–160.
-
- Journal:
- The Journal of Symbolic Logic / Volume 36 / Issue 3 / September 1971
- Published online by Cambridge University Press:
- 12 March 2014, p. 540
- Print publication:
- September 1971
-
- Article
- Export citation
3303. The mth root of n
-
- Journal:
- The Mathematical Gazette / Volume 55 / Issue 393 / June 1971
- Published online by Cambridge University Press:
- 03 November 2016, p. 327
- Print publication:
- June 1971
-
- Article
- Export citation
Trevor Evans. The word problem for abstract algebras. The journal of the London Mathematical Society, vol. 26 (1951), pp. 64–71. - Trevor Evans. Embeddability and the word problem. The journal of the London Mathematical Society, vol. 28 (1953), pp. 76–80.
-
- Journal:
- The Journal of Symbolic Logic / Volume 34 / Issue 3 / 17 November 1969
- Published online by Cambridge University Press:
- 12 March 2014, p. 507
- Print publication:
- 17 November 1969
-
- Article
- Export citation
É. I. Grindlingér. O nérazréšimosti problémy toždéstva slov dlá odnogo klassa polugrupp s razréšimoj problèmoj izomorfizma. Doklady Akadémii Nauk SSSR, vol. 171 (1966), pp. 519–520. - E. I. Grindlinger [Greendlinger]. On the unsolvability of the word problem for a class of semigroups with a solvable isomorphism problem. English translation of the preceding by M. Greendlinger. Soviet mathematics, vol. 7 no. 6 (1967), pp. 1502–1503.
-
- Journal:
- The Journal of Symbolic Logic / Volume 33 / Issue 3 / 10 October 1968
- Published online by Cambridge University Press:
- 12 March 2014, p. 469
- Print publication:
- 10 October 1968
-
- Article
- Export citation