Complexity of Scott Sentences

2018/07/07 by Alvir, Rachael, McCoy, Charles, Knight, Julia · 1 citation
#FOS: Mathematics #Group Theory (math.GR) #Logic (math.LO)

paper · doi:10.48550/arxiv.1807.02715

Abstract

We give effective versions of some results on Scott sentences. We show that if A has a computable Π_α Scott sentence, then the orbits of all tuples are defined by formulas that are computable Σ_β for some β

Cited by

• Relative to any non-arithmetic set

Related

• On the computability of optimal Scott sentences
• An introduction to the Scott complexity of countable structures and a\n survey of recent results
• On optimal Scott sentences of finitely generated algebraic structures
• Describing Groups
• Computable Scott Sentences for Quasi-Hopfian Finitely Presented Structures