Unsolvable algorithmic problems for semigroups, groups and rings

DOI10.1007/BF01094865MaRDI QIDQ1117039zbMATH OpenOpenAlexFDO

Authors G. P. Kukin, Leonid A. Bokut'

Publication date 1989

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01094865

zbMATH Keywords

groupssemigroupsword problemLie algebrasunsolvability of equality problems

Mathematics Subject Classification ID

Generalizations (16Y99) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Lie algebras and Lie superalgebras (17B99) Free semigroups, generators and relations, word problems (20M05) Word problems (aspects of algebraic structures) (08A50)

Cites work

• scientific article; zbMATH DE number 3131132 (Why is no real title available?)
• scientific article; zbMATH DE number 3149985 (Why is no real title available?)
• scientific article; zbMATH DE number 3824108 (Why is no real title available?)
• scientific article; zbMATH DE number 3900715 (Why is no real title available?)
• scientific article; zbMATH DE number 3961574 (Why is no real title available?)
• scientific article; zbMATH DE number 3961577 (Why is no real title available?)
• scientific article; zbMATH DE number 4051899 (Why is no real title available?)
• scientific article; zbMATH DE number 3687624 (Why is no real title available?)
• scientific article; zbMATH DE number 3695455 (Why is no real title available?)
• scientific article; zbMATH DE number 3699175 (Why is no real title available?)
• scientific article; zbMATH DE number 3762288 (Why is no real title available?)
• scientific article; zbMATH DE number 3455515 (Why is no real title available?)
• scientific article; zbMATH DE number 3479158 (Why is no real title available?)
• scientific article; zbMATH DE number 3562106 (Why is no real title available?)
• scientific article; zbMATH DE number 3632614 (Why is no real title available?)
• scientific article; zbMATH DE number 3807843 (Why is no real title available?)
• scientific article; zbMATH DE number 3224578 (Why is no real title available?)
• scientific article; zbMATH DE number 3231085 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3417684 (Why is no real title available?)
• scientific article; zbMATH DE number 3424006 (Why is no real title available?)
• A NOTE ON THE WORD PROBLEM FOR GROUPS
• A note on Post's correspondence problem
• A variant of a recursively unsolvable problem
• Algebraic simplification
• Algorithmic problems for solvable Lie algebras
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II
• An Embedding Theorem for Finitely Generated Groups
• An algebraic characterization of groups with soluble word problem
• An analysis of Turing's The word problem in semi-groups with cancellation
• An unsolvable problem concerning identities
• An unsolvable problem with products of matrices
• Another Characterization of Finitely Generated Groups with a Solvable Word Problem
• Combinatorial systems defined over one- and two-letter alphabets
• Combinatorial systems with axiom
• DECIDABILITY PROBLEMS OF EXTENDED THEORIES
• Das Identitätsproblem für Gruppen mit einer definierenden Relation
• Decidable fragments of universal theories and existentially closed models
• Decision Problems in Group Theory
• Decision problems in classes of group presentations with uniformly solvable word problem
• Dehn's algorithm for the word problem
• Embedding Theorems for Groups
• Embeddings into Simple Groups
• Embeddings into simple associative algebras
• Example of a finitely presented group in the variety \({\mathfrak A}^5\) with the unsolvable word problem
• Fine Degrees of Word Problems of Cancellation Semigroups
• Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility
• Formal Reductions of the General Combinatorial Decision Problem
• General recursive functions of natural numbers
• Groups with relative standard basis
• Gruppen mit vorgeschriebenem Wortproblem
• Halteprobleme von Fang-Systemen (tag systems)
• Infinitely generated subgroups of finitely presented groups. I
• Machine Configuration and Word Problems of Given Degree of Unsolvability
• Markov-Type Properties
• Novikov's centrally symmetric group
• ON ELEMENTARY PROPERTIES OF EXISTENTIALLY CLOSED SYSTEMS
• ON THE WORD AND DIVISIBILITY PROBLEMS IN SEMIGROUPS WITH A SINGLE DEFINING RELATION
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
• On Dehn's algorithm
• On Dehn's algorithm and the conjugacy problem
• On Dehn's algorithms for the conjugacy and word problems, with applications
• On a Problem of J.H.C. Whitehead and a Problem of Alonzo Church.
• On algebraically closed groups
• On recognising properties of groups which have solvable word problem
• On the complexity of individual identity problems in semigroups
• On the complexity of reduction algorithms in Novikov-Boone constructions
• On the conjugacy problem for certain quotient groups of free products
• On theories with a combinatorial definition of 'equivalence'
• One theorem of G. Higman
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Recursive unsolvability of a problem of Thue
• Recursive unsolvability of group theoretic problems
• Recursively enumerable degress and the conjugacy problem
• Recursively enumerable sets of positive integers and their decision problems
• Representation of Turing reducibility by word and conjugacy problems in finitely presented groups
• SOME REMARKS ON VARIETIES OF GROUPS
• Simple projecting maps
• Some Undecidable Problems in Group Theory
• Some algorithmic problems for solvable groups
• Some general algorithms. I: Arithmetic groups
• Subalgebras of finitely defined Lie algebras
• Subgroups of finitely presented groups
• Subgroups of finitely presented metabelian groups
• Subrings of finitely presented associative rings
• The Boone-Higman theorem and the conjugacy problem
• The diamond lemma for ring theory
• The equality problem and free products of Lie algebras and of associative algebras
• The isomorphism problem for solvable groups
• The word problem
• The word problem and the isomorphism problem for groups
• The word problem for division rings
• The word problem for one-relator semigroups
• The word problem in a variety of groups containing N//2A
• The word problem in semi-groups with cancellation
• Theory of Formal Systems. (AM-47)
• Unsolvability of problems of equality and divisibility in certain varieties of semigroups
• Unsolvability of some algebraic problems in the class of associative rings
• Unsolvability of the endomorphic reducibility problem in free nilpotent groups and in free rings
• Unsolvability of the universal theory of finite groups
• Unsolvable Problems in Groups With Solvable Word Problem
• Varieties of groups
• Word and conjugacy problems in groups with only a few defining relations
• Word problems
• Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems
• Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups
• Words in the History of a Turing Machine with a Fixed Input
• [Russian Text Ignored]
• [Russian Text Ignored]
• \(\lambda\)-definability and recursiveness

Cited in

(4)

• Finite Gröbner basis algebras with unsolvable nilpotency problem and zero divisors problem
• scientific article; zbMATH DE number 4097637 (Why is no real title available?)
• Word problems and ceers
• Evaluations of noncommutative polynomials on algebras: methods and problems, and the L'vov-Kaplansky conjecture

This page was built for publication: Unsolvable algorithmic problems for semigroups, groups and rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1117039)