An algebraic characterization of groups with soluble word problem
From MaRDI portal
Cites work
- An Embedding Theorem for Finitely Generated Groups
- Embedding Theorems for Groups
- Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility
- scientific article; zbMATH DE number 3412857 (Why is no real title available?)
- On a Problem of J.H.C. Whitehead and a Problem of Alonzo Church.
- On Group-Theoretic Decision Problems and Their Classification. (AM-68)
- Subgroups of finitely presented groups
- The word problem
- The word problem for semigroups with two generators
- Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems
- Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups
Cited in
(35)- Simplicity and superrigidity of twin building lattices.
- Model-theoretic and algorithmic questions in group theory
- Unsolvable algorithmic problems for semigroups, groups and rings
- Algebraic equivalents of the solvability of group-theoretic algorithmic problems
- Infinite groups
- Decidable fragments of universal theories and existentially closed models
- Gruppen mit vorgeschriebenem Wortproblem
- Infinitely generated subgroups of finitely presented groups. I
- Filters in lattices of quasivarieties of algebraic systems
- An algebra has a solvable word problem if and only if it is embeddable in a finitely generated simple algebra
- The Boone-Higman theorem and the conjugacy problem
- Finitely determined members of varieties of groups and rings
- Constructing finitely presented simple groups that contain Grigorchuk groups
- Groups finitely presented in Burnside varieties
- The word problem of the Brin-Thompson group is \textsf{coNP}-complete
- Finite semigroups embed in finitely presented congruence-free monoids.
- The loop problem for Rees matrix semigroups.
- Satisfaction of existential theories in finitely presented groups and some embedding theorems.
- A countable family of finitely presented infinite congruence-free monoids
- Automorphism groups of totally ordered sets: a retrospective survey
- Groups of Automorphisms of Totally Ordered Sets: Techniques, Model Theory and Applications to Decision Problems
- Group Embeddings with Algorithmic Properties
- ON GROUPS AND COUNTER AUTOMATA
- Embeddings into Simple Free Products
- A characterization of the subgroups of finitely presented groups
- Word problems
- A characterization of subshifts with computable language
- Finitely generated lattice-ordered groups with soluble word problem
- Groups whose word problems are accepted by abelian G-automata
- Embeddings into left‐orderable simple groups
- Embedding finitely presented self-similar groups into finitely presented simple groups
- Logical aspects of Cayley-graphs: the group case
- Hyperbolic groups satisfy the Boone-Higman conjecture
- Finitely presented simple groups with at least exponential Dehn function
- On the isolated points in the space of groups.
This page was built for publication: An algebraic characterization of groups with soluble word problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4059096)
