Word problems

DOI10.1090/S0002-9904-1978-14516-9MaRDI QIDQ4170710zbMATH OpenOpenAlexFDO

Authors 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 (aspects of algebraic structures) (08A50) Word problems, etc. in computability and recursion theory (03D40)

Cites work

• scientific article; zbMATH DE number 3122417 (Why is no real title available?)
• scientific article; zbMATH DE number 3485772 (Why is no real title available?)
• scientific article; zbMATH DE number 3552822 (Why is no real title available?)
• scientific article; zbMATH DE number 3565005 (Why is no real title available?)
• scientific article; zbMATH DE number 3065870 (Why is no real title available?)
• scientific article; zbMATH DE number 3080573 (Why is no real title available?)
• A Finitely Generated Residually Finite Group with an Unsolvable Word Problem
• An algebraic characterization of groups with soluble word problem
• Coset Representations in Free Groups
• Embeddability and the Word Problem
• Free lattices
• Identities and relations in commutative Moufang loops
• On Comparison of Finite Algebras
• On spectra, and the negative solution of the decision problem for identities having a finite nontrivial model
• On the algorithmic insolvability of the word problem in group theory
• Recursive unsolvability of a problem of Thue
• Residual Properties of Infinite Soluble Groups
• Residual finiteness and the Hopf property in rings
• Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
• Some Word-Problems
• Subgroups of finitely presented groups
• The Word Problem for Abstract Algebras
• The diamond lemma for ring theory
• The word problem

Cited in

(21)

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

This page was built for publication: Word problems

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