Word problems and ceers

This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same reducibility degree (under the notion of reducibility for equivalence relations usually called "computable reducibility"), or in the same isomorphism type (with the isomorphism induced by a computable function), or in the same strong isomorphism type (with the isomorphism induced by a computable permutation of the natural numbers). We observe for instance that every ceer is isomorphic to the word problem of some c.e. semigroup, but (answering a question of Gao and Gerdes) not every ceer is in the same reducibility degree of the word problem of some finitely presented semigroup, nor is it in the same reducibility degree of some non-periodic semigroup. We also show that the ceer provided by provable equivalence of Peano Arithmetic is in the same strong isomorphism type as the word problem of some non-commutative and non-Boolean c.e. ring.

[1]  William W. Boone.  Word Problems and Recursively Enumerable Degrees of Unsolvability. A Sequel on Finitely Presented Groups , 1966 .

[2]  Andrea Sorbi,et al.  Classifying Positive Equivalence Relations , 1983, J. Symb. Log..

[3]  Andrea Sorbi,et al.  Joins and meets in the structure of ceers , 2019, Comput..

[4]  Luca San Mauro,et al.  Measuring the complexity of reductions between equivalence relations , 2019, Comput..

[5]  William W. Boone,et al.  Word Problems and Recursively Enumerable Degrees of Unsolvability. A First Paper on Thue Systems , 1966 .

[6]  Andrea Sorbi,et al.  A Survey on Universal Computably Enumerable Equivalence Relations , 2017, Computability and Complexity.

[7]  André Nies,et al.  Calibrating word problems of groups via the complexity of equivalence relations , 2018, Math. Struct. Comput. Sci..

[8]  J. Howie.  Fundamentals of semigroup theory , 1995 .

[9]  Ekaterina B. Fokina,et al.  Linear Orders Realized by C.E. Equivalence Relations , 2016, J. Symb. Log..

[10]  Bakh Khoussainov,et al.  A Journey to Computably Enumerable Structures (Tutorial Lectures) , 2018, CiE.

[11]  Franco Montagna,et al.  Universal Recursion Theoretic Properties of R.E. Preordered Structures , 1985, J. Symb. Log..

[12]  C. Smorynski.  Logical Number Theory I , 1991 .

[13]  Richard Kaye,et al.  Review of Craig Smoryński, Logical Number Theory I, an Introduction , 2000 .

[14]  Yuri L. Ershov,et al.  Theory of Numberings , 1999, Handbook of Computability Theory.

[15]  Saul A. Kripke,et al.  Deduction-preserving "Recursive Isomorphisms" between theories , 1967 .

[16]  C. R. J. Clapham.  Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility , 1964 .

[17]  Desmond Fearnley-Sander,et al.  Universal Algebra , 1982 .

[18]  Y. Lafont.  Word Problem , 2019, 99 Variations on a Proof.

[19]  Su Gao,et al.  Computably Enumerable Equivalence Relations , 2001, Stud Logica.

[20]  Uri Andrews,et al.  On Isomorphism Classes of computably Enumerable Equivalence Relations , 2020, J. Symb. Log..

[21]  A. Sorbi,et al.  EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS , 2019, The Review of Symbolic Logic.

[22]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.

[23]  V. Yu. Shavrukov.  Remarks on Uniformly Finitely Precomplete Positive Equivalences , 1996, Math. Log. Q..

[24]  Franco Montagna,et al.  Relatively precomplete numerations and arithmetic , 1982, J. Philos. Log..

[25]  Sanjay Jain,et al.  Graphs realised by r.e. equivalence relations , 2014, Ann. Pure Appl. Log..

[26]  Andrea Sorbi,et al.  Universal computably Enumerable Equivalence Relations , 2014, J. Symb. Log..

[27]  J. C. Shepherdson,et al.  Machine Configuration and Word Problems of Given Degree of Unsolvability , 1965 .

[28]  Charles F. Miller.  On Group-Theoretic Decision Problems and Their Classification. , 1971 .

[29]  Bolyai János Matematikai Társulat,et al.  Algebraic theory of semigroups , 1979 .

[30]  L. Bokut,et al.  Unsolvable algorithmic problems for semigroups, groups, and rings , 1989 .

[31]  William W. Boone.  Word Problems and Recursively Enumerable Degrees of Unsolvability , 1971 .