Word problems

DOI10.1090/S0002-9904-1978-14516-9zbMath0389.03018OpenAlexW4233942885MaRDI QIDQ4170710

Trevor Evans

Publication date: 1978

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9904-1978-14516-9

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Word problems, etc. in computability and recursion theory (03D40) Word problems (aspects of algebraic structures) (08A50)

Related Items

ON SEPARABILITY FINITENESS CONDITIONS IN SEMIGROUPS, An equational logic sampler, Finitely Presented Lattices, Free Modular Lattices, History and basic features of the critical-pair/completion procedure, The word and generator problems for lattices, Separability conditions in acts over monoids, Unsolvable algorithmic problems for semigroups, groups and rings, Approximability of finitely presented algebras, Bibliography on quantum logics and related structures, A decidable word problem without equivalent canonical term rewriting system, Finite coverability property, A field guide to equational logic, On approximation of locally compact groups by finite algebraic systems, Partition semantics for relations, The finite embeddability property for IP loops and local embeddability of groups into finite IP loops, On subrings of free rings, Deciding embeddability of partial groupoids into semigroups, Residual finiteness in permutation varieties of semigroups, Model-theoretic and algorithmic questions in group theory, Identities and bases in the hypoplactic monoid

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The diamond lemma for ring theory
• Identities and relations in commutative Moufang loops
• Residual finiteness and the Hopf property in rings
• Free lattices
• Residual Properties of Infinite Soluble Groups
• On the algorithmic insolvability of the word problem in group theory
• Subgroups of finitely presented groups
• An algebraic characterization of groups with soluble word problem
• On spectra, and the negative solution of the decision problem for identities having a finite nontrivial model
• Recursive Unsolvability of a problem of Thue
• Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
• Some Word-Problems
• A Finitely Generated Residually Finite Group with an Unsolvable Word Problem
• Coset Representations in Free Groups
• The Word Problem for Abstract Algebras
• On Comparison of Finite Algebras
• Embeddability and the Word Problem
• The word problem