English

On optimal Scott sentences of finitely generated algebraic structures

Logic 2017-02-22 v1

Abstract

Scott showed that for every countable structure A\mathcal{A}, there is a sentence of the infinitary logic Lω1ω\mathcal{L}_{\omega_1\omega}, called a Scott sentence for A\mathcal{A}, whose models are exactly the isomorphic copies of A\mathcal{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 Σ30\Sigma^0_3 Scott sentence. We give a characterization of the finitely generated structures for whom the Σ30\Sigma^0_3 Scott sentence is optimal. One application of this result is to give a construction of a finitely generated group where the Σ30\Sigma^0_3 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

R2 v1 2026-06-22T18:24:17.930Z