Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems

DOI10.2307/1970478zbMATH Open0173.01204OpenAlexW2331518422MaRDI QIDQ2531869FDOQ2531869

Authors: William W. Boone 

Publication date: 1966

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1970478

zbMATH Keywords

recursion theory, constructive mathematics

Cited In (16)

• On recognising Hopf groups
• Unsolvable algorithmic problems for semigroups, groups and rings
• Recursively enumerable degress and the conjugacy problem
• The computability, definability, and proof theory of Artinian rings
• Degrees of unsolvability associated with Markov algorithms
• The equivalence of some general combinatorial decision problems
• On the complexity of reduction algorithms in Novikov-Boone constructions
• Title not available (Why is that?)
• The many-one equivalence of some general combinatorial decision problems
• The post correspondence problem
• Word problems and ceers
• Combinatorial systems defined over one- and two-letter alphabets
• Decision problems for cellular automata and their semigroups
• An algebraic characterization of groups with soluble word problem
• Degrees of unsolvability of the conjugacy problem for finitely-presented groups
• Gruppen mit vorgeschriebenem Wortproblem

This page was built for publication: Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems

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