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 ${\mathcal{L}}_{{\omega }_1\omega }$ that characterizes it among all countable structures. We ca…