A Variety Where the Set of Subalgebras of Finite Simple Algebras is Not Recursive
From MaRDI portal
Publication:4704562
DOI10.1142/S0218196798000338zbMath0938.08001OpenAlexW2163129732MaRDI QIDQ4704562
S. I. Kublanovsky, Mark V. Sapir
Publication date: 13 June 2000
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196798000338
subalgebrasbinary operationsfinite simple algebrasfinitely based variety of algebrasunsolvability of algorithmic problems
Word problems, etc. in computability and recursion theory (03D40) Word problems (aspects of algebraic structures) (08A50)
Related Items
SOLUTION TO A PROBLEM OF KUBLANOVSKY AND SAPIR ⋮ Undecidable problems for completely 0-simple semigroups.
Cites Work