The Word Problem for Abstract Algebras
From MaRDI portal
Publication:5803323
DOI10.1112/jlms/s1-26.1.64zbMath0042.03303OpenAlexW1983867861MaRDI QIDQ5803323
Publication date: 1951
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s1-26.1.64
Related Items (54)
Finitely Presented Lattices ⋮ History and basic features of the critical-pair/completion procedure ⋮ Algorithmic problems for finite groups and finite \(0\)-simple semigroups ⋮ The word and generator problems for lattices ⋮ Free products and the word problem ⋮ The Isomorphism Problem for Some Classes of Multiplicative Systems ⋮ 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 ⋮ Finiteness properties of direct products of algebraic structures ⋮ Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras ⋮ The Word Problem for Finitely Presented Quandles is Undecidable ⋮ Lattices freely generated by an order and preserving certain bounds ⋮ The uniform word problem for groups and finite Rees quotients of \(E\)-unitary inverse semigroups ⋮ Unnamed Item ⋮ Modular proof systems for partial functions with Evans equality ⋮ Decidability of the elementary theory of a finitely defined quasigroup ⋮ Symmetric embeddings of free lattices into each other ⋮ On decidability of theories of finitely generated quasigroups in \(R\)- varieties of groups ⋮ On the word problem of lattices with the help of graphs ⋮ Word Problem for Ringoids of Numerical Functions ⋮ Algorithmic solvability of the word problem for some varieties of linear quasigroups. ⋮ Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability ⋮ Standard Gröbner-Shirshov Bases of Free Algebras Over Rings, I ⋮ Join-completions of partially ordered algebras ⋮ The class of topological spaces is equationally definable ⋮ 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 ⋮ Partition semantics for relations ⋮ Decidability of elementary theories of finitely presented algebras of the variety of algebras defined by the empty system of identities ⋮ Intersection preserving finite embedding theorems for partial quasigroups ⋮ Word problems ⋮ Decidability of elementary theories of certain finitely defined algebras ⋮ Potential Divisibility in Finite Semigroups is Undecidable ⋮ A Variety Where the Set of Subalgebras of Finite Simple Algebras is Not Recursive ⋮ Primitive Elements and One Relation Algebras ⋮ Solution of the basic algorithmic problems in some classes of quasigroups with identities ⋮ Completely Free Lattices Generated by Partially Ordered Sets ⋮ 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 ⋮ Beziehungen zwischen verbands-ähnlichen Algebren und geregelten Mengen ⋮ Finite embedding theorems for partial Latin squares, quasi-groups, and loops ⋮ On free modular lattices. II ⋮ Algorithmic problems for amalgams of finite semigroups ⋮ Deciding embeddability of partial groupoids into semigroups ⋮ Partial algebras-survey of a unifying approach towards a two-valued model theory for partial algebras ⋮ Cut elimination and word problems for varieties of lattices ⋮ A Horn sentence for involution lattices of quasiorders ⋮ Finitely Presented Lattices: Canonical Forms and the Covering Relation ⋮ On finitely presented and free algebras of Cantor varieties ⋮ Characteristic inference rules
This page was built for publication: The Word Problem for Abstract Algebras
