The computability of group constructions II

Publisher： Cambridge University Press

E-ISSN： 1755-1633|8|1|27-60

ISSN： 0004-9727

Source： Bulletin of the Australian Mathematical Society, Vol.8, Iss.1, 1973-02, pp. : 27-60

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

Finitely presented groups having word, problem solvable by functions in the relativized Grzegorczyk hierarchy, {En(A)| n ε N, A N (N the natural numbers)} are studied. Basically the class E3 consists of the elementary functions of Kalmar and En+1 is obtained from En by unbounded recursion. The relativization En(A) is obtained by adjoining the characteristic function of A to the class En.

Related content

Computability and the algebra of fields: Some affine constructions

By  

The Journal of Symbolic Logic, Vol. 45, Iss. 1, 1980-03 ,pp. : 103-120 (18)

Cambridge University Press

Access to resources Recommend Favorite

Constructions of Group Divisible Designs

By Landgev Ivan N.  

Designs, Codes and Cryptography, Vol. 8, Iss. 3, 1996-06 ,pp. : 309-318 (10)

Springer Publishing Company

Access to resources Recommend Favorite

COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA

By  

The Journal of Symbolic Logic, Vol. 80, Iss. 1, 2015-03 ,pp. : 145-178 (34)

Cambridge University Press

Access to resources Recommend Favorite

P versus NP and computability theoretic constructions in complexity theory over algebraic structures

By  

The Journal of Symbolic Logic, Vol. 69, Iss. 1, 2004-03 ,pp. : 39-64 (26)

Cambridge University Press

Access to resources Recommend Favorite

The geometry of Hrushovski constructions, II. The strongly minimal case

By  

The Journal of Symbolic Logic, Vol. 77, Iss. 1, 2012-03 ,pp. : 337-349 (13)

Cambridge University Press

Access to resources Recommend Favorite