On optimal Scott sentences of finitely generated algebraic structures
Abstract
Scott showed that for every countable structure A, there is a sentence of the infinitary logic Lω1ω, called a Scott sentence for A, whose models are exactly the isomorphic copies of A. Thus, the least quantifier complexity of a Scott sentence of a structure is an invariant that measures the complexity "describing" the structure. Knight et al.~have studied the Scott sentences of many structures. In particular, Knight and Saraph showed that a finitely generated structure always has a 03 Scott sentence. We give a characterization of the finitely generated structures for whom the 03 Scott sentence is optimal. One application of this result is to give a construction of a finitely generated group where the 03 Scott sentence is optimal.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.