The word problem
From MaRDI portal
Publication:5895987
DOI10.2307/1970103zbMath0102.00902OpenAlexW2328824725MaRDI QIDQ5895987
Publication date: 1959
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1970103
Related Items (88)
An introduction to computable model theory on groups and fields ⋮ Gröbner-Shirshov bases for some Lie algebras ⋮ Reductions in tree replacement systems ⋮ The post correspondence problem ⋮ The equivalence of some general combinatorial decision problems ⋮ A complex of problems proposed by Post ⋮ WHAT DO TOPOLOGISTS WANT FROM SEIBERG–WITTEN THEORY? ⋮ Hierarchies of Computable groups and the word problem ⋮ A Lyndon's identity theorem for one-relator monoids ⋮ On some algorithmic problems for groups and monoids ⋮ The order problem and the power problem for free product sixth-groups ⋮ Inverse monoids: decidability and complexity of algebraic questions. ⋮ Linearly bounded conjugator property for mapping class groups ⋮ On the homeomorphism problem for 4-manifolds ⋮ Existence theorems in mathematics ⋮ Can you compute the operator norm? ⋮ Clifford monoid presentations ⋮ Twisted conjugacy in Houghton's groups ⋮ Parallel complexity for nilpotent groups ⋮ The isomorphism problem for finite extensions of free groups is in PSPACE ⋮ Representation theorems for recursively enumerable sets and a conjecture related to Poonen's large subring of \(\mathbb Q\) ⋮ The triviality problem for profinite completions ⋮ Parallel algorithms for power circuits and the word problem of the Baumslag group ⋮ Word problems and ceers ⋮ Classifying word problems of finitely generated algebras via computable reducibility ⋮ Separating notions in effective topology ⋮ Improved parallel algorithms for generalized Baumslag groups ⋮ The Bounded and Precise Word Problems for Presentations of Groups ⋮ Unnamed Item ⋮ Efficient Computation in Groups and Simplicial Complexes ⋮ Compressed word problems in HNN-extensions and amalgamated products ⋮ Algorithmically finite groups. ⋮ An automaton group with \textsf{PSPACE}-complete word problem ⋮ Active Learning of Group-Structured Environments ⋮ Generalized sums over histories for quantum gravity. II: Simplicial conifolds ⋮ The word problem for lattice ordered groups ⋮ Orbit decidability and the conjugacy problem for some extensions of groups ⋮ Gröbner-Shirshov bases, conformal algebras, and pseudo-algebras. ⋮ COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS ⋮ EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P ⋮ Gröbner-Shirshov basis of the Adyan extension of the Novikov group. ⋮ Computability Theory and Differential Geometry ⋮ A field guide to equational logic ⋮ Models of active learning in group-structured state spaces ⋮ Join-completions of partially ordered algebras ⋮ THE SUBGROUP IDENTIFICATION PROBLEM FOR FINITELY PRESENTED GROUPS ⋮ Gröbner–Shirshov bases and their calculation ⋮ Groups With Two Generators Having Unsolvable Word Problem and Presentations of Mihailova Subgroups of Braid Groups ⋮ Some Undecidable Problems in Group Theory ⋮ Eliminating unbounded search in computable algebra ⋮ A simple group generated by involutions interchanging residue classes of the integers. ⋮ TC^0 circuits for algorithmic problems in nilpotent groups ⋮ Decision and Search in Non-Abelian Cramer-Shoup Public Key Cryptosystem ⋮ Space Complexity and Word Problems of Groups ⋮ Finding non-trivial elements and splittings in groups. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A recursive presentation for Mihailova's subgroup. ⋮ COMPUTABLE ABELIAN GROUPS ⋮ Symmetric and asymmetric cryptographic key exchange protocols in the octonion algebra ⋮ Computable topological groups and Pontryagin duality ⋮ A constructive approach to Freyd categories ⋮ Word problems ⋮ Complexity of word problems for HNN-extensions ⋮ Paramodulated connection graphs ⋮ Gröbner-Shirshov basis for the braid group in the Birman-Ko-Lee generators. ⋮ Unnamed Item ⋮ Complexity of word problems for HNN-extensions ⋮ Recursively enumerable sets and degrees ⋮ Recursively enumerable degress and the conjugacy problem ⋮ A new non-Hopf group ⋮ Non-commutative Gröbner bases in algebras of solvable type ⋮ GRÖBNER–SHIRSHOV BASES FOR FREE INVERSE SEMIGROUPS ⋮ On recognising Hopf groups ⋮ On the complexity of the identity problem for finitely defined groups ⋮ Simple examples of groups with unsolvable word problem ⋮ DEHN FUNCTION AND LENGTH OF PROOFS ⋮ Asymptotic density and computability ⋮ On equational theories, unification, and (un)decidability ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s ⋮ Four-dimensional topology: an introduction ⋮ The word problem and the isomorphism problem for groups ⋮ Model-theoretic and algorithmic questions in group theory ⋮ European Summer Meeting of the Association for Symbolic Logic, Uppsala 1991 ⋮ On the expressivity of feature logics with negation, functional uncertainty, and sort equations ⋮ Computing fundamental groups from point clouds ⋮ The word problem for division rings ⋮ Compression techniques in group theory
This page was built for publication: The word problem
