Subgroups of finitely presented groups

DOI10.1098/rspa.1961.0132zbMath0104.02101OpenAlexW4361868930MaRDI QIDQ3288145

Graham Higman

Publication date: 1961

Published in: Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1098/rspa.1961.0132

zbMATH Keywords

group theory

Related Items

Parallelizable manifolds and the fundamental group, Hierarchies of Computable groups and the word problem, The order problem and the power problem for free product sixth-groups, Finitely presented extensions by free groups, The Conjugacy Problem in Wreath Products and Free Metabelian Groups, Torsion-free abelian groups with optimal Scott families, Groups with one defining relator, Prefix monoids of groups and right units of special inverse monoids, Groups whose word problems are accepted by abelian \(G\)-automata, The Higman operations and embeddings of recursive groups, A Friedberg enumeration of equivalence structures, Finding bases of uncountable free abelian groups is usually difficult, Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem, ON SOME EMBEDDING OF LIE ALGEBRAS, Hopfian and co-Hopfian groups, Finiteness properties of groups, THE SUBGROUP IDENTIFICATION PROBLEM FOR FINITELY PRESENTED GROUPS, Gröbner–Shirshov bases and their calculation, Amenable groups without finitely presented amenable covers, The loop problem for monoids and semigroups, A Finitely Generated Residually Finite Group with an Unsolvable Word Problem, The conjugacy problem for groups, and Higman embeddings, Unnamed Item, Finitely generated lattice-ordered groups with soluble word problem, Computable topological groups and Pontryagin duality, Notions of Discrimination, DEHN FUNCTION AND LENGTH OF PROOFS, Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian, On subgroups of right angled Artin groups with few generators, Embedding ℚ into a finitely presented group, Subgroups of finitely presented metabelian groups, The word problem for division rings, INDICABLE GROUPS AND ENDOMORPHIC PRESENTATIONS, Gröbner-Shirshov bases for some Lie algebras, Unnamed Item, Finite subgroups of diffeomorphism groups, HOMOLOGY OF GROUPS AND THIRD BUSY BEAVER FUNCTION, Finitely generated nilpotent hc groups are free abelian, Subgroups of almost finitely presented groups, Presentations for vertex-transitive graphs, Abelian \(p\)-groups and the halting problem, Effectively categorical abelian groups, On countable locally described structures, On Finite Presentations for Groups, Reflections on some groups of B. H. Neumann, Sublattice subgroups of finitely presented lattice-ordered groups., Computability in Symbolic Dynamics, Closed manifolds with transcendentalL²-Betti numbers:, Embeddings in finitely presented groups which preserve the center., Unsolvable algorithmic problems for semigroups, groups and rings, Higman's embedding theorem in a general setting and its application to existentially closed algebras, The Jordan property for Lie groups and automorphism groups of complex spaces, Torsion, torsion length and finitely presented groups, Gradings of finite support. Application to injective objects, Iterated effective embeddings of abelian p-groups, On the complexity of the cogrowth sequence, Algorithmically complex residually finite groups, Representation theorems for recursively enumerable sets and a conjecture related to Poonen's large subring of \(\mathbb Q\), Space functions and space complexity of the word problem in semigroups., Graphs are not universal for online computability, Subrings of finitely presented associative rings, Groups finitely presented in Burnside varieties, Decision problems in classes of group presentations with uniformly solvable word problem, Algebraic equivalents of the solvability of group-theoretic algorithmic problems, An automaton group with undecidable order and Engel problems, Subalgebras of finitely defined Lie algebras, Efficient Computation in Groups and Simplicial Complexes, Another example of a finitely presented infinite simple group, Online presentations of finitely generated structures, Endomorphic presentations of branch groups., 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, Groups, graphs, languages, automata, games and second-order monadic logic, On Turing dynamical systems and the Atiyah problem, Decidable fragments of universal theories and existentially closed models, Embeddings determined by universal words in the rank 2 free group, Groups of Automorphisms of Totally Ordered Sets: Techniques, Model Theory and Applications to Decision Problems, Rigidity results for groups with radical cohomology of finite groups and arithmeticity problems, The word problem for lattice ordered groups, Independence in computable algebra, Uniform interpolation and coherence, On the subalgebras of certain finitely presented algebras, Automorphism groups of totally ordered sets: A retrospective survey, Friedberg splittings of recursively enumerable sets, Monoid generalizations of the Richard Thompson groups., Algebraic structures computable without delay, The conjugacy problem in the Grigorchuk group is polynomial time decidable., Filtrations and distortion in infinite-dimensional algebras., Distortion of wreath products in Thompson's group \(F\)., Embedding free Burnside groups in finitely presented groups., Eliminating unbounded search in computable algebra, Logical aspects of Cayley-graphs: the group case, Algebraically closed groups, Infinitely generated subgroups of finitely presented groups. I, Definability in algebraically closed groups, ON GROUPS AND COUNTER AUTOMATA, Satisfaction of existential theories in finitely presented groups and some embedding theorems., A characterization of the subgroups of finitely presented groups, Constructable solvable groups, Subalgebras of finitely presented solvable Lie algebras, Universal group with twenty-one defining relations, COMPUTABLE ABELIAN GROUPS, 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, Word problems, Max Dehn, The Boone-Higman theorem and the conjugacy problem, Finitely presented semigroups and associative algebras, Algebraically closed semigroups, Constructing finitely presented simple groups that contain Grigorchuk groups, 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, The isomorphism problem for Higman-Thompson groups., Finitely presented subgroups of three-manifold groups, Finitely determined members of varieties of groups and rings, Quasi-actions on trees II: Finite depth Bass-Serre trees, An uncountable family of finitely generated residually finite groups, On the integral homology of finitely-presented groups, A construction which can be used to produce finitely presented infinite simple groups, The embedding of certain linear and Abelian groups in finitely presented simple groups, A finitely presented simple group with unsolvable conjugacy problem, Imbeddability of recursively presented inverse semigroups into finitely presented ones, The word problem and the isomorphism problem for groups, Reflections on discriminating groups, A Higman embedding preserving asphericity, Model-theoretic and algorithmic questions in group theory, Asymptotic invariants, complexity of groups and related problems, Unnamed Item, Pseudo-natural algorithms for the word problem for finitely presented monoids and groups