7 citations · 14 across the 5 of their papers we have counts for
1 paper · 1 filter
Nikolay Bazhenov, Dino Rossegger, Maxim Zubkov
In several classes of countable structures it is known that every hyperarithmetic structure has a computable presentation up to bi-embeddability. In this article we investigate the…