4 citations · 12 across the 7 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.LO2019★ 4 cited
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…
math.LO2019★ 3 cited
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…