Subgroups of finitely presented groups
From MaRDI portal
Publication:3288145
DOI10.1098/RSPA.1961.0132zbMATH Open0104.02101OpenAlexW4361868930MaRDI QIDQ3288145FDOQ3288145
Authors: 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
Cited In (only showing first 100 items - show all)
- Representation theorems for recursively enumerable sets and a conjecture related to Poonen's large subring of \(\mathbb Q\)
- A Finitely Generated Residually Finite Group with an Unsolvable Word Problem
- On the integral homology of finitely-presented groups
- Logical aspects of Cayley-graphs: the group case
- The word problem and the isomorphism problem for groups
- Space functions and space complexity of the word problem in semigroups.
- Friedberg splittings of recursively enumerable sets
- Word problems
- Filtrations and distortion in infinite-dimensional algebras.
- Definability in algebraically closed groups
- The Conjugacy Problem in Wreath Products and Free Metabelian Groups
- Iterated effective embeddings of abelian \(p\)-groups
- Title not available (Why is that?)
- The conjugacy problem in the Grigorchuk group is polynomial time decidable.
- Notions of Discrimination
- A Higman embedding preserving asphericity.
- Another example of a finitely presented infinite simple group
- Algebraically closed groups
- Computability in Symbolic Dynamics
- Embeddings into hopfian groups
- Subrings of finitely presented associative rings
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
- Higman's embedding theorem in a general setting and its application to existentially closed algebras
- Finite subgroups of diffeomorphism groups
- Endomorphic presentations of branch groups.
- Sublattice subgroups of finitely presented lattice-ordered groups.
- Eliminating unbounded search in computable algebra
- Computable topological groups and Pontryagin duality
- Computable abelian groups
- A finitely presented simple group with unsolvable conjugacy problem
- An automaton group with undecidable order and Engel problems
- Groups, graphs, languages, automata, games and second-order monadic logic
- Model-theoretic and algorithmic questions in group theory
- The isomorphism problem for Higman-Thompson groups.
- Abelian \(p\)-groups and the halting problem
- The word problem for lattice ordered groups
- Gröbner-Shirshov bases and their calculation
- Finitely presented extensions by free groups
- On Turing dynamical systems and the Atiyah problem
- Amenable groups without finitely presented amenable covers
- Rigidity results for groups with radical cohomology of finite groups and arithmeticity problems
- Satisfaction of existential theories in finitely presented groups and some embedding theorems.
- On the complexity of the identity problem for finitely defined groups
- Finiteness properties of groups
- Embedding free Burnside groups in finitely presented groups.
- Embeddings in finitely presented groups which preserve the center.
- Closed manifolds with transcendental \(L^2\)-Betti numbers.
- Gröbner-Shirshov bases for some Lie algebras
- A construction which can be used to produce finitely presented infinite simple groups
- Monoid generalizations of the Richard Thompson groups.
- DEHN FUNCTION AND LENGTH OF PROOFS
- On subgroups of right angled Artin groups with few generators
- Constructing finitely presented simple groups that contain Grigorchuk groups
- The loop problem for monoids and semigroups
- ON GROUPS AND COUNTER AUTOMATA
- Algorithmically complex residually finite groups
- A family of groups with nice word problems
- ON SOME EMBEDDING OF LIE ALGEBRAS
- Torsion-free abelian groups with optimal Scott families
- Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen
- Reflections on discriminating groups
- Constructable solvable groups
- Finitely presented subgroups of three-manifold groups
- Independence in computable algebra
- Subalgebras of finitely presented solvable Lie algebras
- Quasi-actions on trees. II: Finite depth Bass-Serre trees.
- 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
- The conjugacy problem for groups, and Higman embeddings
- Title not available (Why is that?)
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
- Effectively categorical abelian groups
- Decision problems in classes of group presentations with uniformly solvable word problem
- The Jordan property for Lie groups and automorphism groups of complex spaces
- An algebraic characterization of groups with soluble word problem
- Infinitely generated subgroups of finitely presented groups. I
- Subgroups of finitely presented metabelian groups
- An uncountable family of finitely generated residually finite groups
- Algebraic structures computable without delay
- Every \(\Delta^0_2\) Polish space is computable topological
- Hierarchies of Computable groups and the word problem
- Groups with context-free Diophantine problem
- Max Dehn
- On countable locally described structures
- Embeddings into groups with only a few defining relations
- Groups finitely presented in Burnside varieties
- Finitely presented semigroups and associative algebras
- Algebraically closed semigroups
- On benign subgroups constructed by Higman's sequence building operation
- Uniform interpolation and coherence
- On the subalgebras of certain finitely presented algebras
- One theorem of G. Higman
- The subgroup identification problem for finitely presented groups.
- Unsolvable algorithmic problems for semigroups, groups and rings
- Decidable fragments of universal theories and existentially closed models
- Groups of Automorphisms of Totally Ordered Sets: Techniques, Model Theory and Applications to Decision Problems
- Finitely generated lattice-ordered groups with soluble word problem
- Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian
- Homology of groups and third busy beaver function
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)