scientific article; zbMATH DE number 3045417
From MaRDI portal
zbMath0029.10101MaRDI QIDQ5783653
Publication date: 1947
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A Lyndon's identity theorem for one-relator monoids, On ground AC-completion, On some algorithmic problems for groups and monoids, The word and generator problems for lattices, On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups, Computing homology using generalized Gröbner bases, The Bounded and Precise Word Problems for Presentations of Groups, Algorithmically finite groups., Generic complexity of finitely presented monoids and semigroups, From Analytical Mechanics Problems to Rewriting Theory Through M. Janet’s Work, Martin Davis and Hilbert’s Tenth Problem, Hyperarithmetical Sets, The word problem for one-relation monoids: a survey, Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability, The multiplicative-additive Lambek calculus with subexponential and bracket modalities, A strong geometric hyperbolicity property for directed graphs and monoids., The undecidability of the elementary theory of lattices of all equational theories of large signature, Subexponentials in non-commutative linear logic, Frontier between decidability and undecidability: A survey, Polygraphs of finite derivation type, The word problem and the isomorphism problem for groups, On one-relator groups and units of special one-relation inverse monoids
