Frank B. Cannonito. Hierarchies of computable groups and the word problem. The journal of symbolic logic, vol. 31 , pp. 376–392

Journal of Symbolic Logic 33 (1):121 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,400

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Hierarchies of Computable Groups and the Word Problem.Frank B. Cannonito - 1968 - Journal of Symbolic Logic 33 (1):121-121.
Hierarchies of computable groups and the word problem.Frank B. Cannonito - 1966 - Journal of Symbolic Logic 31 (3):376-392.
Review: T. Rado, On Non-Computable Functions. [REVIEW]F. B. Cannonito - 1967 - Journal of Symbolic Logic 32 (4):524-524.
Computable Abelian groups.Alexander G. Melnikov - 2014 - Bulletin of Symbolic Logic 20 (3):315-356,.
Subrecursion: Functions and Hierarchies.H. E. Rose - 1984 - Oxford University Press.

Analytics

Added to PP
2016-06-30

Downloads
11 (#846,528)

6 months
3 (#227,001)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references