En∖En−1-entscheidbare Gruppen

  • J. Avenhaus
  • K. Madlener
Part of the Lecture Notes in Computer Science book series (LNCS, volume 33)


Enumerable Degree Dann Gilt 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    Boone W.W., Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups. Ann. of Math. 84 (1966), 49–84.Google Scholar
  2. [2]
    Cannonito F.B., Hierarchies of computable groups and the word problem. J. of Symb. Logic 31 (1966), 376–392.Google Scholar
  3. [3]
    Cannonito F.B., Gatterdam R.W., The computability of group constructions, Part I, in Word problems. North-Holland (1973), 365–400.Google Scholar
  4. [4]
    Davis M., Computability and unsolvability. Mac Graw Hill (1958).Google Scholar
  5. [5]
    Gatterdam R.W., The Higman theorem for En (A) computable groups, in Lecture Notes Math. 319, Springer (1973), 71–74.Google Scholar
  6. [6]
    von Henke, Weihrauch, Indermark, Hierarchies of primitive recursive wordfunctions and transductions defined by automata, in Nivat (Ed.), IRIA Symposium July 3–7 (1972).Google Scholar
  7. [7]
    Meyer A., Ritchie D., A classification of the recursive functions, Z. math. Logik, Grundlagen d. Math. 18 (1972), 71–82.Google Scholar
  8. [8]
    Rotman J.J., The theory of groups, 2. Edition, Allyn & Bacon (1973).Google Scholar
  9. [9]
    Weihrauch K., Teilklassen primitiv-rekursiver Wortfunktionen, GMD Berichte, Bonn, Nr. 91 (1974).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • J. Avenhaus
    • 1
  • K. Madlener
    • 1
  1. 1.Universität KaiserslauternGermany

Personalised recommendations