Subgroups of finitely presented groups

Cited in

(only showing first 100 items - show all)

scientific article; zbMATH DE number 7559149 (Why is no real title available?)
ON GROUPS AND COUNTER AUTOMATA
A family of groups with nice word problems
The order problem and the power problem for free product sixth-groups
Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen
ON SOME EMBEDDING OF LIE ALGEBRAS
Torsion-free abelian groups with optimal Scott families
Constructable solvable groups
Asymptotic mapping class groups of Cantor manifolds and their finiteness properties (with an appendix by Oscar Randal-Williams)
Reflections on discriminating groups
Finitely presented subgroups of three-manifold groups
Reflections on some groups of B. H. Neumann
Independence in computable algebra
Parallelizable manifolds and the fundamental group
Subalgebras of finitely presented solvable Lie algebras
Subalgebras of finitely defined Lie algebras
The embedding of certain linear and Abelian groups in finitely presented simple groups
Imbeddability of recursively presented inverse semigroups into finitely presented ones
Quasi-actions on trees. II: Finite depth Bass-Serre trees.
The conjugacy problem for groups, and Higman embeddings
Effectively categorical abelian groups
Finitely determined members of varieties of groups and rings
Decision problems in classes of group presentations with uniformly solvable word problem
scientific article; zbMATH DE number 3523536 (Why is no real title available?)
The Jordan property for Lie groups and automorphism groups of complex spaces
Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
Finding bases of uncountable free abelian groups is usually difficult
Infinitely generated subgroups of finitely presented groups. I
Universal group with twenty-one defining relations
The Boone-Higman theorem and the conjugacy problem
Isomorphic embeddability of semigroups with countable sets of defining relations in finitely defined semigroups
An algebraic characterization of groups with soluble word problem
Subgroups of finitely presented metabelian groups
An uncountable family of finitely generated residually finite groups
Distortion of wreath products in Thompson's group \(F\).
Automorphism groups of totally ordered sets: a retrospective survey
A Friedberg enumeration of equivalence structures
Algebraic structures computable without delay
Representation theorems for recursively enumerable sets and a conjecture related to Poonen's large subring of Q
Logical aspects of Cayley-graphs: the group case
Every \(\Delta^0_2\) Polish space is computable topological
Space functions and space complexity of the word problem in semigroups.
On the integral homology of finitely-presented groups
A Finitely Generated Residually Finite Group with an Unsolvable Word Problem
Friedberg splittings of recursively enumerable sets
Hierarchies of Computable groups and the word problem
Filtrations and distortion in infinite-dimensional algebras.
The word problem and the isomorphism problem for groups
Definability in algebraically closed groups
Word problems
Max Dehn
On countable locally described structures
Iterated effective embeddings of abelian \(p\)-groups
Groups with context-free Diophantine problem
The Conjugacy Problem in Wreath Products and Free Metabelian Groups
scientific article; zbMATH DE number 3501750 (Why is no real title available?)
Embeddings into groups with only a few defining relations
The conjugacy problem in the Grigorchuk group is polynomial time decidable.
Groups finitely presented in Burnside varieties
Finitely presented semigroups and associative algebras
Algebraically closed semigroups
Another example of a finitely presented infinite simple group
Uniform interpolation and coherence
A Higman embedding preserving asphericity.
Notions of Discrimination
Algebraically closed groups
On the subalgebras of certain finitely presented algebras
On benign subgroups constructed by Higman's sequence building operation
Subrings of finitely presented associative rings
Embeddings into hopfian groups
Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
Finite subgroups of diffeomorphism groups
Computability in Symbolic Dynamics
Higman's embedding theorem in a general setting and its application to existentially closed algebras
One theorem of G. Higman
Unsolvable algorithmic problems for semigroups, groups and rings
Decidable fragments of universal theories and existentially closed models
Endomorphic presentations of branch groups.
The subgroup identification problem for finitely presented groups.
Sublattice subgroups of finitely presented lattice-ordered groups.
Groups of Automorphisms of Totally Ordered Sets: Techniques, Model Theory and Applications to Decision Problems
Eliminating unbounded search in computable algebra
Finitely generated lattice-ordered groups with soluble word problem
Computable topological groups and Pontryagin duality
Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian
Homology of groups and third busy beaver function
A finitely presented simple group with unsolvable conjugacy problem
Subgroups of almost finitely presented groups
Asymptotic invariants, complexity of groups and related problems.
Computable abelian groups
An automaton group with undecidable order and Engel problems
Efficient Computation in Groups and Simplicial Complexes
Presentations for vertex-transitive graphs
Groups, graphs, languages, automata, games and second-order monadic logic
Prefix monoids of groups and right units of special inverse monoids
Abelian p-groups and the halting problem
The isomorphism problem for Higman-Thompson groups.
Model-theoretic and algorithmic questions in group theory
On Finite Presentations for Groups
The word problem for lattice ordered groups

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)