A. Markov. Névozmožnost' algorifmov raspoznavaniá nékotoryh svojstv associativnyh sistém (Impossibility of algorithms for recognizing some properties of associative systems). Doklady Akadémii Nauk SSSR, vol. 77 (1951), pp. 953–956.

Andrzej Mostowski

doi:10.2307/2266280

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Mayoh, B.H. 1965. Formal Systems and Recursive Functions. Vol. 40, Issue. , p. 272.

Boone, W.W. Haken, W. and Poénaru, V. 1968. Contributions to Mathematical Logic - Proceedings of the Logic Colloquium, Hannover 1966. Vol. 50, Issue. , p. 37.

Yasuhara, Ann 1974. Some Non‐Recursive Classes of Thue Systems With Solvable Word Problem. Mathematical Logic Quarterly, Vol. 20, Issue. 8-12, p. 121.

Ó'Dúnlaing, Colm 1983. Undecidable questions related to Church-Rosser Thue systems. Theoretical Computer Science, Vol. 23, Issue. 3, p. 339.

Otto, Friedrich 1985. Rewriting Techniques and Applications. Vol. 202, Issue. , p. 95.

Otto, F. 1986. On deciding whether a monoid is a free monoid or is a group. Acta Informatica, Vol. 23, Issue. 1, p. 99.

Otto, Friedrich 1986. Church–Rosser Thue Systems that Present Free Monoids. SIAM Journal on Computing, Vol. 15, Issue. 3, p. 786.

Otto, Friedrich 1986. On two problems related to cancellativity. Semigroup Forum, Vol. 33, Issue. 1, p. 331.

Bürckert, Hans-Jürgen Herold, Alexander and Schmidt-Schauß, Manfred 1987. Rewriting Techniques and Applications. Vol. 256, Issue. , p. 204.

Narendran, Paliath and Otto, Friedrich 1988. Elements of finite order for finite weight-reducing and confluent thue systems. Acta Informatica, Vol. 25, Issue. 5, p. 573.

Narendran, Paliath and Otto, Friedrich 1989. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Vol. 356, Issue. , p. 341.

Narendran, Paliath and Ó'Dúnlaing, Colm 1989. Cancellativity in finitely presented semigroups. Journal of Symbolic Computation, Vol. 7, Issue. 5, p. 457.

Otto, Friedrich 1989. Rewriting Techniques and Applications. Vol. 355, Issue. , p. 359.

Bürckert, Hans-Jürgen Herold, Alexander and Schmidt-Schauss, Manfred 1989. On equational theories, unification, and (Un)decidability. Journal of Symbolic Computation, Vol. 8, Issue. 1-2, p. 3.

Narendran, Paliath Ó'Dúnlaing, Colm and Otto, Friedrich 1991. It is undecidable whether a finite special string-rewriting system presents a group. Discrete Mathematics, Vol. 98, Issue. 2, p. 153.

Article contents

A. Markov. Névozmožnost' algorifmov raspoznavaniá nékotoryh svojstv associativnyh sistém (Impossibility of algorithms for recognizing some properties of associative systems). Doklady Akadémii Nauk SSSR, vol. 77 (1951), pp. 953–956.

Abstract

Access options

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Article contents

A. Markov. Névozmožnost' algorifmov raspoznavaniá nékotoryh svojstv associativnyh sistém (Impossibility of algorithms for recognizing some properties of associative systems). Doklady Akadémii Nauk SSSR, vol. 77 (1951), pp. 953–956.

Abstract

Access options

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests