Recursive unsolvability of group theoretic problems
From MaRDI portal
Publication:768811
DOI10.2307/1969933zbMath0079.24802OpenAlexW2333555861MaRDI QIDQ768811
Publication date: 1958
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1969933
Related Items
Relative linear dependence problem for the variety \({\mathfrak AN}_ {\mathbf{c}}\) of Lie algebras ⋮ A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods ⋮ On rigidity and the isomorphism problem for tree braid groups. ⋮ Decision problems for distributive lattice-ordered semigroups ⋮ An equational logic sampler ⋮ On some algorithmic problems for groups and monoids ⋮ Book review of: F. Bassino et al., Complexity and randomness in group theory. GAGTA book 1 ⋮ On Finite Presentations for Groups ⋮ Computable Isomorphism Invariants for the Fundamental Group of the Complement of a Plane Projective Curve ⋮ Complexity, combinatorial group theory and the language of palutators ⋮ Degrees of Unsolvability: A Tutorial ⋮ Algorithmic recognition of infinite cyclic extensions ⋮ On the homeomorphism problem for 4-manifolds ⋮ Unsolvable algorithmic problems for semigroups, groups and rings ⋮ Clifford monoid presentations ⋮ The origins of combinatorics on words ⋮ Groups with one defining relator ⋮ Ends of Schreier graphs of hyperbolic groups ⋮ Finding simple curves in surface covers is undecidable ⋮ Alfred Tarski and undecidable theories ⋮ Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two ⋮ The word problem for small cancellation quotients of groups acting on trees ⋮ The computational complexity of knot genus in a fixed 3‐manifold ⋮ The triviality problem for profinite completions ⋮ On a lower bound for the connectivity of the independence complex of a graph ⋮ Decision problems in classes of group presentations with uniformly solvable word problem ⋮ Algebraic equivalents of the solvability of group-theoretic algorithmic problems ⋮ Groups Defined by Permutations of a Single Word ⋮ Grushko-Like Theorems for a Class of Finitely Presented Semigroups ⋮ Some recognizable properties of solvable groups ⋮ The problem of solvability of a positive theory of an arbitrary group is algorithmically unsolvable ⋮ On the finiteness problem for classes of modular lattices ⋮ Markov-Type Properties ⋮ Decidable fragments of universal theories and existentially closed models ⋮ Generalized sums over histories for quantum gravity. II: Simplicial conifolds ⋮ When are two elements of \(GL(2,\mathbb{Z}{})\) similar? ⋮ Groups of Automorphisms of Totally Ordered Sets: Techniques, Model Theory and Applications to Decision Problems ⋮ The isomorphism problem for multiparameter quantized Weyl algebras. ⋮ Gröbner-Shirshov basis of the Adyan extension of the Novikov group. ⋮ The computational complexity of torsion-freeness of finitely presented groups ⋮ On subsumption and semiunification in feature algebras ⋮ Computability Theory and Differential Geometry ⋮ Remarks concerning finitely generated semigroups having regular sets of unique normal forms ⋮ The B B Newman spelling theorem ⋮ Some properties of finite special string-rewriting systems ⋮ A field guide to equational logic ⋮ Detecting infinitely many semisimple representations in a fixed finite dimension. ⋮ Unnamed Item ⋮ THE SUBGROUP IDENTIFICATION PROBLEM FOR FINITELY PRESENTED GROUPS ⋮ The isomorphism problem for all hyperbolic groups. ⋮ Gröbner–Shirshov bases and their calculation ⋮ Some Undecidable Problems in Group Theory ⋮ Effective universal coverings and local minima of the length functional on loop spaces ⋮ Unrecognizability of manifolds ⋮ Finding non-trivial elements and splittings in groups. ⋮ Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems ⋮ Base-undecidable properties of universal varieties ⋮ Cutting corners ⋮ A generalization of a power-conjugacy problem in torsion-free negatively curved groups ⋮ Distinguishability of a Semi-Group by a Machine ⋮ Die Nielsenäquivalenzklassen der metabelsch gemachten Torusknotengruppen ⋮ Gröbner-Shirshov basis for the braid group in the Birman-Ko-Lee generators. ⋮ Groups of order 1. Some properties of presentations ⋮ The computational complexity of knot genus and spanning area ⋮ Some reflections on cohomological dimension and freeness ⋮ Recursively enumerable degress and the conjugacy problem ⋮ GRÖBNER–SHIRSHOV BASES FOR FREE INVERSE SEMIGROUPS ⋮ On recognising Hopf groups ⋮ Syntactic and Rees indices of subsemigroups ⋮ On recognising properties of groups which have solvable word problem ⋮ Detecting properties from descriptions of groups ⋮ Operator scaling: theory and applications ⋮ Unsolvability of some algebraic problems in the class of associative rings ⋮ Mass problems associated with effectively closed sets ⋮ On the group property recognition problem ⋮ Inclusion problem for a certain class of groups ⋮ Small cancellation theory over Burnside groups ⋮ Wreath products and finitely presented groups ⋮ What is a universal computing machine? ⋮ Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian ⋮ Computing simplicial representatives of homotopy group elements ⋮ The isomorphism problem for toral relatively hyperbolic groups. ⋮ Undecidable questions related to Church-Rosser Thue systems ⋮ The word problem and the isomorphism problem for groups ⋮ Model-theoretic and algorithmic questions in group theory ⋮ Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II ⋮ La théorie des fonctions récursives et ses applications. (Exposé d'information générale) ⋮ The word problem for division rings ⋮ On one-relator groups and units of special one-relation inverse monoids
This page was built for publication: Recursive unsolvability of group theoretic problems
