pith. sign in

arxiv: 1702.06448 · v1 · pith:UY5UZM3Cnew · submitted 2017-02-21 · 🧮 math.LO

On optimal Scott sentences of finitely generated algebraic structures

classification 🧮 math.LO
keywords scottsentencefinitelygeneratedmathcalstructureoptimalsigma
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.