The Word Problem for Abstract Algebras

Cited in

(55)

History and basic features of the critical-pair/completion procedure
The word and generator problems for lattices
Free products and the word problem
On decidability of theories of finitely generated quasigroups in \(R\)- varieties of groups
On the word problem of lattices with the help of graphs
Equational classes of Steiner systems
Strong finite embeddability for classes of quasigroups
A finite partial idempotent latin cube can be embedded in a finite idempotent latin cube
Finite embeddability in a class of infinitary algebras
Intersection preserving finite embedding theorems for partial quasigroups
Deciding embeddability of partial groupoids into semigroups
Algorithmic problems for finite groups and finite \(0\)-simple semigroups
The uniform word problem for groups and finite Rees quotients of \(E\)-unitary inverse semigroups
Algorithmic problems for amalgams of finite semigroups
Finiteness properties of direct products of algebraic structures
Symmetric embeddings of free lattices into each other
Decidability of elementary theories of certain finitely defined algebras
Partial algebras-survey of a unifying approach towards a two-valued model theory for partial algebras
A Horn sentence for involution lattices of quasiorders
On finitely presented and free algebras of Cantor varieties
Join-completions of partially ordered algebras
Algorithmic solvability of the word problem for some varieties of linear quasigroups.
The class of topological spaces is equationally definable
Characteristic inference rules
On the multiplicative groups of free and free commutative quasigroups
On the word problem in the free quasigroups in the varieties of quasigroups isotopic to groups
Modular proof systems for partial functions with Evans equality
Solution of the basic algorithmic problems in some classes of quasigroups with identities
Free decompositions in certain primitive classes of abstract algebras
Embedding partial idempotent Latin squares
Finite partial cyclic triple systems can be finitely embedded
Identities preserved by the singular direct product
Finite embedding theorems for partial Latin squares, quasi-groups, and loops
The word problem for finitely presented quandles is undecidable
Completely Free Lattices Generated by Partially Ordered Sets
Finitely Presented Lattices: Canonical Forms and the Covering Relation
Standard Gröbner-Shirshov Bases of Free Algebras Over Rings, I
Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras
Primitive Elements and One Relation Algebras
Lattices freely generated by an order and preserving certain bounds
Finitely Presented Lattices
Word problems
Potential Divisibility in Finite Semigroups is Undecidable
A Variety Where the Set of Subalgebras of Finite Simple Algebras is Not Recursive
Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability
The Isomorphism Problem for Some Classes of Multiplicative Systems
scientific article; zbMATH DE number 3246279 (Why is no real title available?)
Word Problem for Ringoids of Numerical Functions
Partition semantics for relations
Decidability of elementary theories of finitely presented algebras of the variety of algebras defined by the empty system of identities
On the uniform word problem for lattices
Beziehungen zwischen verbands-ähnlichen Algebren und geregelten Mengen
On free modular lattices. II
Cut elimination and word problems for varieties of lattices
Decidability of the elementary theory of a finitely defined quasigroup

This page was built for publication: The Word Problem for Abstract Algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5803323)