The word problem in semi-groups with cancellation
From MaRDI portal
Publication:2648519
DOI10.2307/1969481zbMath0037.30103OpenAlexW2002942454MaRDI QIDQ2648519
Publication date: 1950
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1969481
Related Items
Gröbner-Shirshov bases for some Lie algebras, The computability, definability, and proof theory of Artinian rings, The word problem for cancellation semigroups with zero, A Lyndon's identity theorem for one-relator monoids, Unsolvable algorithmic problems for semigroups, groups and rings, The Bounded and Precise Word Problems for Presentations of Groups, Product decompositions of semigroups induced by action pairs, Computability and Recursion, Conceptual Confluence in 1936: Post and Turing, Why Post Did [Not Have Turing’s Thesis], The word problem for one-relation monoids: a survey, Gröbner-Shirshov basis of the Adyan extension of the Novikov group., The B B Newman spelling theorem, Gröbner–Shirshov bases and their calculation, A strong geometric hyperbolicity property for directed graphs and monoids., Turing oracle machines, online computing, and three displacements in computability theory, Monoïdes préordonnés et chaînes de Malcev, On free modular lattices. II, The Developments of the Concept of Machine Computability from 1936 to the 1960s, The word problem and the isomorphism problem for groups, Non-finitely generated maximal subgroups of context-free monoids, Model-theoretic and algorithmic questions in group theory, On one-relator groups and units of special one-relation inverse monoids
