Papers
Topics
Authors
Recent
Search
2000 character limit reached

On optimal Scott sentences of finitely generated algebraic structures

Published 21 Feb 2017 in math.LO | (1702.06448v1)

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 $\Sigma0_3$ Scott sentence. We give a characterization of the finitely generated structures for whom the $\Sigma0_3$ Scott sentence is optimal. One application of this result is to give a construction of a finitely generated group where the $\Sigma0_3$ Scott sentence is optimal.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.