Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. F. B. Cannonito, Hierarchies of computable groups and the word problem, Journal of symbolic logic 31 (1966) 376–392.
2. F. B. Cannonito and R. W. Gatterdam, The computability of group constructions, part I, Proceedings of the Irvine conference on decision problems in group theory (North Holland in preparation).
3. C. R. J. Clapham, Finitely presented groups with word problem of arbitrary degrees of insolubility, Proceedings of the London Mathematical Society 14 (1966) 633–676.
4. C. R. J. Clapham, An embedding theorem for finitely generated groups, Proceedings of the London Mathematical Society 17 (1967) 419–430.
5. R. W. Gatterdam, Embeddings of primitive recursive computable groups, doctoral dissertation, University of California, Irvine, 1970. Submitted to Annals of mathematical logic.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献