2 papers
math.LO2019
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.LO2018
Complexity of Scott Sentences
Rachael Alvir, Charles McCoy, Julia Knight
We give effective versions of some results on Scott sentences. We show that if has a computable Scott sentence, then the orbits of all tuples are defined by for…