scientific article; zbMATH DE number 3045417

Cited in

(27)

The word and generator problems for lattices
Frontier between decidability and undecidability: A survey
The word problem for one-relation monoids: a survey
The multiplicative-additive Lambek calculus with subexponential and bracket modalities
A Lyndon's identity theorem for one-relator monoids
The undecidability of the elementary theory of lattices of all equational theories of large signature
Polygraphs of finite derivation type
From Analytical Mechanics Problems to Rewriting Theory Through M. Janet’s Work
Martin Davis and Hilbert's tenth problem
Hyperarithmetical Sets
Computing homology using generalized Gröbner bases
The word problem and the isomorphism problem for groups
Generic complexity of finitely presented monoids and semigroups
On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups
On ground AC-completion
On some algorithmic problems for groups and monoids
The Bounded and Precise Word Problems for Presentations of Groups
Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability
Subexponentials in non-commutative linear logic
On one-relator groups and units of special one-relation inverse monoids
Algorithmically finite groups.
On syntactic concept lattice models for the Lambek calculus and infinitary action logic
A Lopez-Escobar theorem for continuous domains
Two-sided homological properties of special and one-relator monoids
HNN extensions and embedding theorems for groups
Algorithmic complexity of theories with Kleene iteration
A strong geometric hyperbolicity property for directed graphs and monoids.

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)