Cited in
(only showing first 100 items - show all)- Model-theoretic and algorithmic questions in group theory
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
- On countable locally described structures
- Unsolvable algorithmic problems for semigroups, groups and rings
- Subrings of finitely presented associative rings
- Decision problems in classes of group presentations with uniformly solvable word problem
- Algebraic equivalents of the solvability of group-theoretic algorithmic problems
- Subalgebras of finitely defined Lie algebras
- Another example of a finitely presented infinite simple group
- Decidable fragments of universal theories and existentially closed models
- Algebraically closed groups
- Infinitely generated subgroups of finitely presented groups. I
- Definability in algebraically closed groups
- Constructable solvable groups
- Subalgebras of finitely presented solvable Lie algebras
- Universal group with twenty-one defining relations
- Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen
- An algebra has a solvable word problem if and only if it is embeddable in a finitely generated simple algebra
- Max Dehn
- The Boone-Higman theorem and the conjugacy problem
- Finitely presented semigroups and associative algebras
- Algebraically closed semigroups
- Finitely generated nilpotent hc groups are free abelian
- Higman's embedding theorem in a general setting and its application to existentially closed algebras
- Endomorphic presentations of branch groups.
- Finitely determined members of varieties of groups and rings
- Subgroups of almost finitely presented groups
- The Jordan property for Lie groups and automorphism groups of complex spaces
- Torsion, torsion length and finitely presented groups
- Algorithmically complex residually finite groups
- An automaton group with undecidable order and Engel problems
- Uniform interpolation and coherence
- Constructing finitely presented simple groups that contain Grigorchuk groups
- Gradings of finite support. Application to injective objects
- Rigidity results for groups with radical cohomology of finite groups and arithmeticity problems
- Eliminating unbounded search in computable algebra
- An uncountable family of finitely generated residually finite groups
- Presentations for vertex-transitive graphs
- On the complexity of the cogrowth sequence
- Graphs are not universal for online computability
- Groups finitely presented in Burnside varieties
- Online presentations of finitely generated structures
- Embeddings determined by universal words in the rank 2 free group
- Distortion of wreath products in Thompson's group \(F\).
- Gröbner-Shirshov bases for some Lie algebras
- Effectively categorical abelian groups
- Embedding free Burnside groups in finitely presented groups.
- Satisfaction of existential theories in finitely presented groups and some embedding theorems.
- Isomorphic embeddability of semigroups with countable sets of defining relations in finitely defined semigroups
- On the complexity of the identity problem for finitely defined groups
- Embeddings into hopfian groups
- One theorem of G. Higman
- Finitely presented subgroups of three-manifold groups
- Computable abelian groups
- Finite subgroups of diffeomorphism groups
- A Higman embedding preserving asphericity.
- Indicable groups and endomorphic presentations.
- Iterated effective embeddings of abelian p-groups
- Automorphism groups of totally ordered sets: a retrospective survey
- Abelian p-groups and the halting problem
- Quasi-actions on trees. II: Finite depth Bass-Serre trees.
- Asymptotic invariants, complexity of groups and related problems.
- Homology of groups and third busy beaver function
- Reflections on some groups of B. H. Neumann
- Computability in Symbolic Dynamics
- Closed manifolds with transcendental L^2-Betti numbers.
- Groups of Automorphisms of Totally Ordered Sets: Techniques, Model Theory and Applications to Decision Problems
- Reflections on discriminating groups
- ON GROUPS AND COUNTER AUTOMATA
- Efficient Computation in Groups and Simplicial Complexes
- On Finite Presentations for Groups
- On the integral homology of finitely-presented groups
- Representation theorems for recursively enumerable sets and a conjecture related to Poonen's large subring of Q
- The word problem and the isomorphism problem for groups
- Space functions and space complexity of the word problem in semigroups.
- A family of groups with nice word problems
- Embeddings into groups with only a few defining relations
- An algebraic characterization of groups with soluble word problem
- scientific article; zbMATH DE number 3501750 (Why is no real title available?)
- The word problem for lattice ordered groups
- scientific article; zbMATH DE number 3523536 (Why is no real title available?)
- On the subalgebras of certain finitely presented algebras
- A characterization of the subgroups of finitely presented groups
- Word problems
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
- Hopfian and co-Hopfian groups
- Groups, graphs, languages, automata, games and second-order monadic logic
- DEHN FUNCTION AND LENGTH OF PROOFS
- Torsion-free abelian groups with optimal Scott families
- A Friedberg enumeration of equivalence structures
- Finding bases of uncountable free abelian groups is usually difficult
- On Turing dynamical systems and the Atiyah problem
- The conjugacy problem for groups, and Higman embeddings
- Computable topological groups and Pontryagin duality
- Subgroups of finitely presented metabelian groups
- The word problem for division rings
- Parallelizable manifolds and the fundamental group
- The subgroup identification problem for finitely presented groups.
- Amenable groups without finitely presented amenable covers
- Independence in computable algebra
This page was built for publication: Subgroups of finitely presented groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3288145)
