Hierarchies of Computable groups and the word problem 1

Publisher： Cambridge University Press

E-ISSN： 1943-5886|31|3|376-392

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.31, Iss.3, 1966-09, pp. : 376-392

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The Word Problem for Pride Groups

By Davidson Peter  

Communications in Algebra, Vol. 42, Iss. 4, 2014-04 ,pp. : 1448-1459

Taylor & Francis Ltd

Access to resources Recommend Favorite

The isomorphism problem for computable Abelian p -groups of bounded length

By  

The Journal of Symbolic Logic, Vol. 70, Iss. 1, 2005-03 ,pp. : 331-345

Cambridge University Press

Access to resources Recommend Favorite

COMPUTABLE ABELIAN GROUPS

By  

Bulletin of Symbolic Logic, Vol. 20, Iss. 3, 2014-10 ,pp. : 315-356

Cambridge University Press

Access to resources Recommend Favorite

The Word Problem for Polynilpotent Groups with a Single Primitive Defining Relation

By Gupta Ch.   Romanovskii N.  

Algebra and Logic, Vol. 45, Iss. 1, 2006-01 ,pp. : 17-25

Springer Publishing Company

Access to resources Recommend Favorite

The isomorphism problem for classes of computable fields

By Calvert Wesley  

Archive for Mathematical Logic, Vol. 43, Iss. 3, 2004-04 ,pp. : 327-336

Springer Publishing Company

Access to resources Recommend Favorite