4 citations · 13 across the 9 of their papers we have counts for
3 papers · 1 filter
Coding in graphs and linear orderings
Julia Knight, Alexandra Soskova, Stefan Vatev
There is a Turing computable embedding of directed graphs in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform interpretation; i.e., for a…
Cohesive Powers of Linear Orders
Rumen Dimitrov, Valentina Harizanov, Andrey Morozov +3
Cohesive powers of computable structures can be viewed as effective ultraproducts over effectively indecomposable sets called cohesive sets. We investigate the isomorphism types of…
Computable embeddings for pairs of linear orders
Nikolay Bazhenov, Hristo Ganchev, Stefan Vatev
We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orde…