Switch to: References

Add citations

You must login to add citations.
  1. An introduction to the Scott complexity of countable structures and a survey of recent results.Matthew Harrison-Trainor - 2022 - Bulletin of Symbolic Logic 28 (1):71-103.
    Every countable structure has a sentence of the infinitary logic $\mathcal {L}_{\omega _1 \omega }$ which characterizes that structure up to isomorphism among countable structures. Such a sentence is called a Scott sentence, and can be thought of as a description of the structure. The least complexity of a Scott sentence for a structure can be thought of as a measurement of the complexity of describing the structure. We begin with an introduction to the area, with short and simple proofs (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation