scientific article; zbMATH DE number 3045417
From MaRDI portal
Publication:5783653
zbMATH Open0029.10101MaRDI QIDQ5783653FDOQ5783653
Publication date: 1947
Title of this publication is not available (Why is that?)
Cited In (22)
- The word problem and the isomorphism problem for groups
- Subexponentials in non-commutative linear logic
- The word and generator problems for lattices
- Computing homology using generalized Gröbner bases
- Algorithmically finite groups.
- The Bounded and Precise Word Problems for Presentations of Groups
- Hyperarithmetical Sets
- Frontier between decidability and undecidability: A survey
- Martin Davis and Hilbert’s Tenth Problem
- Generic complexity of finitely presented monoids and semigroups
- The multiplicative-additive Lambek calculus with subexponential and bracket modalities
- A strong geometric hyperbolicity property for directed graphs and monoids.
- On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups
- On some algorithmic problems for groups and monoids
- From Analytical Mechanics Problems to Rewriting Theory Through M. Janet’s Work
- The word problem for one-relation monoids: a survey
- On one-relator groups and units of special one-relation inverse monoids
- A Lyndon's identity theorem for one-relator monoids
- Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability
- Polygraphs of finite derivation type
- On ground AC-completion
- The undecidability of the elementary theory of lattices of all equational theories of large signature
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5783653)
