Calibrating word problems of groups via the complexity of equivalence relations
Logic
2016-09-13 v1
Abstract
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal co-computably enumerable equivalence relation. (3) Each c.e. truth-table degree contains the word problem of a finitely generated group of computable permutations.
Keywords
Cite
@article{arxiv.1609.03371,
title = {Calibrating word problems of groups via the complexity of equivalence relations},
author = {André Nies and Andrea Sorbi},
journal= {arXiv preprint arXiv:1609.03371},
year = {2016}
}
Comments
13 pages