20 citations · 54 across the 26 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.LO2020
Word problems and ceers
Valentino Delle Rose, Luca San Mauro, Andrea Sorbi
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)…
math.LO2020
Comparing the isomorphism types of equivalence structures and preorders
Nikolay Bazhenov, Luca San Mauro
A general theme of computable structure theory is to investigate when structures have copies of a given complexity . We discuss such problem for the case of equivalence structur…