On the complexity of individual identity problems in semigroups
- 18 Downloads
KeywordsMathematical Logic Individual Identity Identity Problem
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.
Unable to display preview. Download preview PDF.
- 1.J. C. Shepherdson, "Machine configuration and word problems of given degrees of unsolvability," Zeitschrift f. Math. Logik und Grundlagen d. Math.,11, No. 2, 149–175 (1965).Google Scholar
- 2.B. A. Trakhtenbrot, "On the complexity of the reduction algorithms in the Novikov-Boone constructions," Algebra i Logika,8, No. 1, 93–128 (1969).Google Scholar
- 3.B. A. Trakhtenbrot, "Optimal computations and the Yablonskii frequency phenomenon," Algebra i Logika,4, No. 5, 79–93 (1965).Google Scholar
© Consultants Bureau, a division of Plenum Publishing Corporation 1971