On optimal Scott sentences of finitely generated algebraic structures
Logic
2017-02-22 v1
Abstract
Scott showed that for every countable structure , there is a sentence of the infinitary logic , called a Scott sentence for , whose models are exactly the isomorphic copies of . 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 Scott sentence. We give a characterization of the finitely generated structures for whom the Scott sentence is optimal. One application of this result is to give a construction of a finitely generated group where the Scott sentence is optimal.
Cite
@article{arxiv.1702.06448,
title = {On optimal Scott sentences of finitely generated algebraic structures},
author = {Matthew Harrison-Trainor and Meng-Che Ho},
journal= {arXiv preprint arXiv:1702.06448},
year = {2017}
}
Comments
13 pages, 1 figure