10 citations · 12 across the 3 of their papers we have counts for
4 papers · 1 filter
On the computability of optimal Scott sentences
Rachael Alvir, Barbara Csima, Matthew Harrison-Trainor
Given a countable mathematical structure, its Scott sentence is a sentence of the infinitary logic that characterizes it among all countable structures. We ca…
Interpreting a field in its Heisenberg group
Rachael Alvir, Wesley Calvert, Grant Goodman +6
We improve on and generalize a 1960 result of Maltsev. For a field , we denote by the Heisenberg group with entries in . Maltsev showed that there is a copy of def…
The complexity of Scott sentences of scattered linear orders
Rachael Alvir, Dino Rossegger
Given a countable scattered linear order of Hausdorff rank we show that it has a Scott sentence. Ash calculated the back and forth relations for al…
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…