May 8
Jason Block,
William and Mary
Scott Analysis of Ordered Structures
Scott analysis yields a method for measuring the complexity of countable structures. In particular, it describes the complexity of describing a structure up to isomorphism, the complexity of automorphism orbits, and the difficulty of building isomorphisms between copies of a structure. We apply this analysis to ordered algebraic structures such as Presburger groups, divisible ordered abelian groups, and real closed fields. We also make use and compare these results to past work that was done with linear orders and models of Peano arithmetic.