Classifying word problems of finitely generated algebras via computable reducibility

DOI10.1142/s0218196723500339arXiv2305.11563MaRDI QIDQ6116397

Luca San Mauro, Valentino Delle Rose, Andrea Sorbi

Publication date: 18 July 2023

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.11563

zbMATH Keywords

computably enumerable equivalence relationsfinitely generated algebrasword problemscomputable reducibilitycomputably enumerable structures

Mathematics Subject Classification ID

Word problems, etc. in computability and recursion theory (03D40) Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definability of linear orders over negative equivalences
• Algorithmically finite groups.
• Reducibilities among equivalence relations induced by recursively enumerable structures
• A journey to computably enumerable structures (tutorial lectures)
• Finitely presented expansions of computably enumerable semigroups
• The category of equivalence relations
• The theory of ceers computes true arithmetic
• Graphs realised by r.e. equivalence relations
• \(\Pi^0_1\)-presentations of algebras
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Turing Computability
• A Survey on Universal Computably Enumerable Equivalence Relations
• LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
• A quest for algorithmically random infinite structures
• INITIAL SEGMENTS OF THE DEGREES OF CEERS
• Joins and meets in the structure of ceers
• Effective aspects of algorithmically random structures
• Two notes on subshifts
• Finitely presented expansions of groups, semigroups, and algebras
• Machine Configuration and Word Problems of Given Degree of Unsolvability
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• The degrees of hyperhyperimmune sets
• The word problem
• Computably enumerable equivalence relations
• Word problems and ceers

This page was built for publication: Classifying word problems of finitely generated algebras via computable reducibility